Learning Resources
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/resources.md - App:
foundations - Semester:
semester-02-algorithms - Module:
module-03-graph-algorithms - Unit kind:
resource - Curation level:
generated_default
Learning objectives
- Pick a high-value support resource for Learning Resources without replacing the learner-facing module sequence.
- State why the chosen source belongs in the current learning problem before spending time on it.
- Return from the external resource with a concrete next action in the module.
Prerequisites
- The earlier concept pages and practice tasks in the current module.
Source books
algorithms-sedgewickcompetitive-programminggrokking-algorithmsintroduction-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
Competitive Programming
- /books/competitive-programming via
Competitive Programming: SCC - /books/competitive-programming/chapter-04-overview-and-motivation via
CP 4.4.4: SSSP with negative cycles,CP 4.4: Single-Source Shortest Paths
Grokking Algorithms
- /books/grokking-algorithms/chapter-07-working-with-dijkstra-s-algorithm-terminology via
Grokking: Dijkstra implementation
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,CLRS 23.3: Johnson's Algorithm - /books/introduction-to-algorithms-clrs/chapter-24-flow-networks via
CLRS 24.1: Flow Networks,CLRS 24.2: Ford-Fulkerson (Part 3),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: Bipartite Matching Revisited,CLRS 25.3: Hungarian Algorithm
The Algorithm Design Manual
- /books/the-algorithm-design-manual/chapter-05-graph-traversal via
ADM 5.7: Applications of BFS,ADM 5.9: Applications of DFS,ADM: Flavors of Graphs,ADM: Getting the Graph,ADM: Graph Traversal - /books/the-algorithm-design-manual/chapter-06-minimum-spanning-trees via
ADM 6.1.2: Kruskal's Algorithm,ADM 6.1.3: Union-Find,ADM 6.1.4: Variations on MST,ADM 6.3.1: Dijkstra,ADM 6.5: Network Flows and Bipartite Matching,ADM 6.6: Design Graphs, Not Algorithms,ADM: Nothing But Nets war story
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 Learning Resources, and treat outside material as supporting enrichment only.