Readings for Graph Algorithms
Below is a detailed list of the readings from the textbook (IA) for graph algorithms:
Basic Graph Algorithms
- Graph terminology: Appendix B.4
- Graph representations: IA 22.1
- BFS: IA 22.2 (stop at section titled "Analysis" on pg. 597)
- DFS: IA 22.3 (stop at section "Properties of depth-first search" on pg. 606), contine on to read "Classification of Edges" on pg.609-610
- Topological sort: IA 22.4
Shortest Paths
- Shortest path preliminary reading: pg. 643-650
- Dijkstras: IA 24.3
- Bellman-Ford: IA 24.1
All-Pairs Shortest Paths
- All-Pairs shortest path preliminary reading: pg. 684-685
- Floyd-Warshall Algorithm: IA 25.2
Minimum Spanning Trees
- Preliminary reading: 23.0-23.1
- Prim's Algorithm: pg. 634-636