BFS Traversal
âļ Play
⸠Pause
âģ Reset
Step
Speed:
800ms
Current:
None
Queue:
[]
Visited:
0
/
0
Step:
0
Unvisited
Current
Exploring
Visited
đ Ready to start BFS traversal
About BFS:
Breadth-First Search explores neighbors level by level using a queue, ensuring shortest path in unweighted graphs.