Chapter 4 References
Chapter 4 References
The sources below support the topics in Chapter 4. The chapter pages explain graph representations and algorithm invariants; this page collects the shared books and websites used to verify them.
Books
| Source | Topics |
|---|---|
| Introduction to Algorithms | Graph representations, BFS, DFS, topological sorting, SCCs, spanning trees, shortest paths, and network flow |
| Algorithms, 4th Edition | Graph data structures, priority queues, pathfinding, matching, and complexity analysis |
| The Algorithm Design Manual | Graph modeling, algorithm selection, and practical implementation tradeoffs |
| Grokking Algorithms | Intuitive introductions to graph search, greedy algorithms, and heuristic methods |
Websites
| Source | Topics |
|---|---|
| GeeksforGeeks | Graph representations, traversals, topological sort, SCCs, MSTs, A*, bidirectional search, and network flow |
| Algorithms, 4th Edition Resources | Reference implementations and analysis exercises |