Step 1 — Advanced Graph Algorithms
🗺️
Graph Algorithms: Navigate Weighted Networks
Dijkstra: relax edges → dist[B]=5, dist[C]=3, dist[D]=8 → shortest paths from source
Goal: Implement Dijkstra's with heap, Kruskal's MST with Union-Find, and topological sort.