Book Exercise Lanes
This generated surface maps a learner-facing curriculum unit to its canonical source routes.
Curriculum surface
- Open learner-facing unit
- Curriculum path:
content/curriculum/foundations/semester-02-algorithms/module-03-graph-algorithms/exercises.md - App:
foundations - Semester:
semester-02-algorithms - Module:
module-03-graph-algorithms - Unit kind:
exercise - Curation level:
generated_default
Learning objectives
- Turn Book Exercise Lanes into active practice instead of passive rereading.
- Use the mapped source routes to supply examples, drills, or recovery help only when needed.
- Finish the exercise with visible evidence that the skill moved from recognition toward recall or execution.
Prerequisites
- The earlier concept pages and practice tasks in the current module.
Source books
algorithms-sedgewickcompetitive-programmingintroduction-to-algorithms-clrsthe-algorithm-design-manual
Source routes
Algorithms Sedgewick
- /books/algorithms-sedgewick/chapter-32-elementary-graph-algorithms-part-1 via
Sedgewick: Elementary Graph Algorithms (Part 1) - /books/algorithms-sedgewick/chapter-35-network-flow via
Sedgewick: Network Flow - /books/algorithms-sedgewick/chapter-36-matching via
Sedgewick: Matching
Competitive Programming
- /books/competitive-programming/chapter-01-competitive-programming via
Competitive Programming: SSSP with negative cycles (Part 1) - /books/competitive-programming/chapter-02-overview-and-motivation via
Competitive Programming: Graph - /books/competitive-programming/chapter-04-overview-and-motivation via
Competitive Programming: All-Pairs Shortest Paths,Competitive Programming: Minimum Spanning Tree,Competitive Programming: Network Flow,Competitive Programming: SSSP on weighted graphs - /books/competitive-programming/chapter-09-art-gallery-problem via
Competitive Programming: Graph matching
Introduction To Algorithms Clrs
- /books/introduction-to-algorithms-clrs/chapter-20-representations-of-graphs via
CLRS 20.1: Representations of Graphs,CLRS 20.2: Breadth-First Search,CLRS 20.3: Depth-First Search,CLRS 20.4: Topological Sort,CLRS 20.5: Strongly Connected Components - /books/introduction-to-algorithms-clrs/chapter-21-growing-a-minimum-spanning-tree via
CLRS 21.1: Growing an MST,CLRS 21.2: Kruskal and Prim - /books/introduction-to-algorithms-clrs/chapter-22-the-bellman-ford-algorithm via
CLRS 22.1: Bellman-Ford Algorithm,CLRS 22.3: Dijkstra's Algorithm,CLRS 22.5: Proofs of Shortest-Paths Properties - /books/introduction-to-algorithms-clrs/chapter-23-shortest-paths-and-matrix-multiplication via
CLRS 23.2: Floyd-Warshall Algorithm - /books/introduction-to-algorithms-clrs/chapter-24-flow-networks via
CLRS 24.1: Flow Networks,CLRS 24.2: Ford-Fulkerson Method,CLRS 24.3: Maximum Bipartite Matching - /books/introduction-to-algorithms-clrs/chapter-25-maximum-bipartite-matching-revisited via
CLRS 25.1: Maximum Bipartite Matching Revisited
The Algorithm Design Manual
- /books/the-algorithm-design-manual/chapter-01-robot-tour-optimization via
ADM 1.7: Exercises - /books/the-algorithm-design-manual/chapter-05-graph-traversal via
ADM 5.11: Graph Traversal Exercises - /books/the-algorithm-design-manual/chapter-06-minimum-spanning-trees via
ADM 6.2: Nothing But Nets war story,ADM 6.5: Network Flows and Bipartite Matching,ADM 6.7: Weighted Graph Exercises,ADM: Dialing for Documents war story - /books/the-algorithm-design-manual/chapter-notes-4-11-exercises via
ADM: Chapter Notes
Supporting curriculum routes
No supporting curriculum routes linked yet.
External enrichment
No curated enrichment resources yet.
AI companion modes
- Explain simply
- Socratic tutor
- Quiz me
- Challenge my understanding
- Diagnose my confusion
- Generate extra practice
- Revision mode
- Connect forward / backward
Source-of-truth note
This teaching unit is learner-facing guidance assembled from multiple canonical book routes. Use the listed source books as the primary conceptual spine for Book Exercise Lanes, and treat outside material as supporting enrichment only.