Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graphs (Terminology (Graph (Subgraph (Spanning Subgraph (Spanning Tree),…
Graphs
Terminology
Graph
Directed
Strongly Connected
Weakly Connected
Mixed
#
#
Undirected
Connected
Multigraph
Simple
Subgraph
Spanning Subgraph
Spanning Tree
Connected Component
Block
Forest
Tree
Complete Graph
Vertice
Adjacent
Outgoing Edge
Incomming Edge
End vertice
or
Endpoint
Origin
Destination
Degree
Out-degree
In-degree
Isolation Vetice
Cut Vertice
or
articulation points
Edge
Directed
#
#
#
Undirected
#
Incident
Parallel Edge
or
Multiple Edge
#
#
#
Self-Loop
#
Bridge
or
Cut-edge
Path
Cycle
Simple Cycle
Directed Cycle
Simple path
Directed Path
Representation
Adjacency Matrix
Incident matrix
Adjacency List
Shorted path
Floyd
Complexity
O(v^3)
May Contain Negative Edge
No negative Cycle
Dijkstra
Greedy Method
No negative Cycle
May Contain Negative Edge
Complexity: O(v^2)
Minimum Spanning Tree
Prim Jarnik
Greedy Method
Kruskal
Greedy Method
Graph Coloring
Chromatic Number
Sequential Coloring
Contain
Not Contain
Contain
Containt