Reading¶
- Jeff Erickson’s Chapter 7 - Minimum Spanning Trees; Kruskal’s & Prim’s algorithms
- Jeff Erickson’s Chapter 8 - Single Source Shortest Path; Dijkstra’s algorithm
Supplemental¶
- OpenDSA: Graphs - Shortest-Paths Problems; Minimal Cost Spanning Trees; Kruskal’s Algorithm
- Aho & Ullman: 9.5 [PDF] - Greedy Algorithms; Minimum Spanning Trees; Kruskal’s Algorithm
- Aho & Ullman: 9.8 [PDF] - Dijkstra’s Algorithm
Levitin¶
- Levitin 9.0-9.3
- Greedy Algorithms; Minimal Spanning Trees; Prim’s Algorithm; Kruskal’s Algorithm; Dijkstra’s Algorithm