Loop

Graphs

Flood fill, multi-source BFS, topological ordering, and union-find connectivity.

0 of 8 lessons complete · 187 min total

Start module
  1. Graphs: Representations & Traversal ChoiceAdjacency lists, grids as implicit graphs, BFS for shortest-unweighted vs DFS for components/paths, and multi-source BFS for spreading processes.Lesson · 17 minNot completed
  2. BFS Wave vs DFS TendrilThe two traversals contrasted on the same graph.Animation · 11 minNot completed
  3. Topological SortOrdering tasks by prerequisites, and detecting impossible cycles.Animation · 10 minNot completed
  4. Union-FindIncremental connectivity without paths.Animation · 10 minNot completed
  5. Practice: Flood Fill & RegionsGrid DFS for islands, areas, border-connected regions, and dual-ocean reachability, plus graph cloning.medium×55 problems · 0 solvedPractice · 45 minNot completed
  6. Practice: BFS WavesMulti-source BFS for spreading distance and time, and BFS over word-transformation states.medium×2hard3 problems · 0 solvedPractice · 40 minNot completed
  7. Practice: Ordering & ConnectivityTopological sort with cycle detection and union-find for components, trees, and redundant edges.medium×55 problems · 0 solvedPractice · 45 minNot completed
  8. Graphs CheckpointBFS vs DFS vs topo vs union-find selection, multi-source setups, and cycle detection.Checkpoint · 9 minNot completed