Reading Guide
Use the authored lessons as the main path. Read a source to resolve a named question, then close it and reconstruct a proof or solve a fresh task. Book links open indexes; locate topics in your edition rather than trusting guessed section numbers. Full-book reading is a separate track, not a prerequisite for this module.
| Block | Source topic | Output and stopping point |
|---|---|---|
| Models and traversal | Skiena: graph flavors, traversal, BFS, DFS | Model card, BFS layer proof and iterative DFS events; P1–P6 |
| Directed structure | Sedgewick and Wayne: directed graphs, topological order, strong components | Explain transpose/finish roles and certify a condensation DAG; P7–P8 |
| Route costs | CLRS: relaxation, Dijkstra, Bellman–Ford, Floyd–Warshall | State preconditions, distinguish round semantics, classify affected targets; P9–P12 |
| Minimum connection | Skiena and CLRS: MSTs, cut/cycle proofs, Kruskal, Prim, disjoint sets | Respecting-cut exchange with ties and forest certificate; P13–P16 |
| Capacities and assignments | CLRS: residual networks, Edmonds–Karp, max-flow/min-cut; Skiena: bipartite matching | Feasible flow/cut equality and two-direction integral reduction; P17–P20 |
Local source map
Repository readers can use the supplied collections directly:
Books/The Algorithm Design Manual/contents/README.mdmaps chunks 060 (graph flavors), 066–072 (traversal/BFS/DFS/SCC), 076–079 (MST/union-find/variants), 081–082 (shortest paths) and 085 (flows/matching). Chunk identifiers are local navigation aids, not universal chapter numbers. OCR can corrupt notation; verify formulas against the PDF and state assumptions explicitly.reading/Algorithms/CLRS.pdfis the proof reference. Use the named topics; chapter/page numbering varies by edition. This PDF is not included in the lab ZIP.Resources/software-development-main/books/data structures and algorithms/Algorithms-4th-Edition-By-Robert Sedgewick and Kevin Wayne.pdfoffers implementation comparisons. Compare invariants and contracts rather than copying a source algorithm into your independent submission.- The same Resources directory contains Advanced Algorithms and Data Structures by Marcello La Rocca and Algorithmic Thinking by Daniel Zingaro. These are optional depth/exercise candidates after the core; no full-book review or exact graph-section assignment is claimed for those files in this revision.
Depth path
Choose one defined output: Tarjan with a component-stack proof; Prim against Kruskal; Floyd–Warshall with pairwise negative-cycle classification; 0–1 BFS; or a stronger flow algorithm with its own invariant and small-instance oracle. Keep planarity, general matching, directed arborescences and distributed graph systems for targeted extensions. They are not unexplained required implementations.
The primary external resources support specific topics. A source's shorthand description does not replace the module's explicit numeric, identity, and reachability contracts. Stop reading when you can demonstrate the corresponding task independently; return only for a concrete unresolved question.