Graph Algorithms: BFS, DFS, Topological Sort & Network Routing Project
Master graph representations and algorithms: Adjacency Lists, BFS Shortest Path, DFS Cycle Detection, Kahn's Topological Sort, Dijkstra's algorithm, and build a network routing project.
Tree traversals and queue/stack data structures
Deep mastery of adjacency representations, BFS/DFS, Kahn's topological sort, Dijkstra's shortest path, and Kruskal's MST.
Read in order, or jump to what you need.
Every lesson builds on the one before it. Open any lesson to read the explanation, run the examples, and try the practice challenges.
- 14.01Graph Architectures: Adjacency Lists vs Matrices & BFS/DFS Traversals4 min
Deconstruct graph data structures. Contrast space complexity of Adjacency Lists vs Adjacency Matrices, and implement BFS and DFS traversals with cycle detection.
- 14.02Topological Sort (Kahn's) & Dijkstra's Shortest Path Algorithm4 min
Master advanced graph algorithms. Implement Kahn's BFS Topological Sort for task scheduling, and Dijkstra's algorithm with PriorityQueue for weighted shortest paths.
- 14.03Disjoint Set Union (DSU) with Path Compression and Kruskal's Minimum Spanning Tree4 min
Master Disjoint Set Union (Union-Find) with path compression and union-by-rank, applying it to cycle detection and Kruskal's Minimum Spanning Tree algorithm.
- 14.04Guided Project 4: High-Performance Network Packet Routing SimulatorProject4 min
Build an industrial network packet routing engine. Model router vertices, calculate lowest-latency paths via Dijkstra, and re-route around link failures dynamically.
Ready to move on?
Deliver Project 4: Distributed Network Routing & Topology Engine.
Open the module self-check