Graph Algorithms
A 20-module path through graph algorithms, in study order from foundations to the frontier.
Modules
- Graph Representations: Adjacency Lists and Matrices
- Breadth-First Search
- BFS Shortest Paths on Unweighted Graphs
- Depth-First Search
- DFS Edge Classification and Timestamps
- Topological Sort
- Strongly Connected Components
- Single-Source Shortest Paths Framework
- Edge Relaxation and Optimal Substructure
- DAG Shortest Paths
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- All-Pairs Shortest Paths Overview
- Floyd-Warshall Algorithm
- Minimum Spanning Trees and the Cut Property
- Kruskal's Algorithm
- Prim's Algorithm
- Network Flow Fundamentals
- Ford-Fulkerson Method
- Max-Flow Min-Cut Theorem