Loop

Advanced Graphs

Weighted shortest paths, minimum spanning trees, and Eulerian paths.

0 of 5 lessons complete · 121 min total

Start module
  1. Weighted Graphs: Picking the Right AlgorithmDijkstra for non-negative weights, Bellman-Ford when hop counts are constrained, Prim's for spanning trees, and Hierholzer's for use-every-edge itineraries — with the signals that distinguish them.Lesson · 18 minNot completed
  2. Dijkstra with a Ticket HeapGreedy lock-in of shortest distances.Animation · 10 minNot completed
  3. Practice: Shortest & CheapestClassic Dijkstra, Prim's MST, and hop-limited Bellman-Ford.medium×33 problems · 0 solvedPractice · 40 minNot completed
  4. Practice: Hard Path StructuresLexical Eulerian paths, minimax elevation Dijkstra, and character-precedence topological sort.hard×33 problems · 0 solvedPractice · 45 minNot completed
  5. Advanced Graphs CheckpointAlgorithm selection by weights/constraints and complexity of each approach.Checkpoint · 8 minNot completed