Please enable JavaScript.
Coggle requires JavaScript to display documents.
(M11) CHAPTER 1,3,4 - Coggle Diagram
(M11) CHAPTER 1,3,4
Graph
-
Adjacent
u are adjacent to v in the pair (u, v)
-
-
-
-
-
-
Cycle
Path of positive length which starts and ends in the same vertex and does not traverse the same edge more than once
-
Representation of Graphs
Adjacency Matrix
-
1 to there is a edge connecting, 0 to there is not
-
-
-
-
Topological Sorting
Can we list some vertices in such an order that for every edge in the graph, the vertex where the edge starts is listed before the vertex where the edge ends?
-