Graph Traversal Step-Through — DFS vs. BFS
Step 0 of 10
Depth-First Search stack
Visit order not started
Breadth-First Search queue
Visit order not started
Unvisited   Current   Visited   Backtracked from   — hover any node to see its adjacency list.