Graph algorithms

BFS

Explore the bfs traversal algorithm — watch the visualization trace through each step.

breadth-first search

currentvisitedin queuealready visited

Queue (front → back)

empty

Visited (in order)

none yet

choose a start node, then press ▶ play or step →

start