Please enable JavaScript.
Coggle requires JavaScript to display documents.
M10 - Coggle Diagram
M10
Graphs
Vertices
Edges
Directed
Endpoints (Edges)
Undirected
Tail/head (Edges)
Dense/Sparse
Complete
Adjacency Matrix
More efficient when depicting dense graphs
Adjacency lists
Good for representing sparse graphs
Weighted graphs
Weighted Matrix
Path
Path length
Direct path
Connectivity
Cycle
Depth-First Search
Depth-first search forest
Tree edge
Back edge
Efficiency
For the matrix is on Θ(V²)
For the list is on Θ(V+E)
Breadth First Search
Topological sorting