Graph

Jump to bottom

Shao ye edited this page Dec 28, 2020 · 1 revision

Graph

Node (Vetex)
Edge
- Directly
- Undirectly

Complexity Analysis

V
E

Problems

Shortest Path
- Unit Length (BFS)
- Arbitrary Length (Dijkstra)
Connectivity
Topological Sort
Traverse

Solutions

DFS
- backtracking + state
BFS
- shortest path + unit length