Week 17: Shortest Paths & MST
Begin Phase 5 by conquering weighted graphs. Master Dijkstra's Algorithm for finding the shortest path and Prim's Algorithm for building Minimum Spanning Trees in Java.
Begin Phase 5 by conquering weighted graphs. Master Dijkstra's Algorithm for finding the shortest path and Prim's Algorithm for building Minimum Spanning Trees in Java.
Master the Disjoint Set Union (DSU) data structure. Learn how to dynamically track connected components and optimize with Path Compression and Union by Rank in Java.
Transition from trees to general networks. Master graph representations, Adjacency Lists, and grid-based DFS/BFS traversals in Java.
Master Directed Acyclic Graphs (DAGs), cycle detection in directed graphs, and dependency resolution using Kahn's Algorithm (Topological Sort) in Java.