Graph traversal algorithms visit every reachable node in a graph. BFS explores level-by-level (shortest path in unweighted graphs). DFS goes deep before backtracking (topological sort, cycle detection, connected components). These form the basis for pathfinding, dependency resolution, and network analysis.
The 5-Mode Loop
5 of 5 modes available
Read · See · Animate · Test · Build
Before this, understand: recursion