Week 6 — Advanced Graph Algorithms
Topics: Dijkstra's · Topological Sort · Union Find · Minimum Spanning Trees
🚧 Content coming soon. This week's material is being prepared. Check back shortly.
What you'll learn this week
- Dijkstra's as BFS with a priority queue: derive it, don't memorise it
- Topological sort via DFS finish times and Kahn's algorithm — both derived
- Union-Find: path compression and union by rank from first principles
- Kruskal's and Prim's MST algorithms and when each is faster
Problems to solve
| Problem | Difficulty | Pattern |
|---|---|---|
| Network Delay Time | Medium | Dijkstra |
| Course Schedule II | Medium | Topological Sort |
| Number of Connected Components | Medium | Union Find |
| Redundant Connection | Medium | Union Find |
| Min Cost to Connect All Points | Medium | MST (Prim's) |
Full notes, code walkthroughs, and video sessions will be added here.