Graph Traversal
Explore graph structures using traversal techniques like BFS, DFS, and shortest path algorithms.
Course-level introduction. Renders above the chapter list.
Breadth-first search explores nodes level by level using a queue.
Depth-first search explores as far as possible along each branch before backtracking.
Order nodes in a directed acyclic graph based on dependencies.
Efficiently manage connected components using disjoint set union.
Find shortest distances in graphs using BFS, Dijkstra, and other algorithms.
Apply graph traversal techniques on grid-based problems.