Graph Traversal Visualization

Depth-First Search (DFS) vs Breadth-First Search (BFS)

Algorithm:
Current Algorithm: Depth-First Search
Step: 0
Nodes Visited: 0 / 0

Legend:

Starting Point
Unvisited Node
Visited Node (with step number)
Currently Processing