Breadth-first search on a seven-node graph. Press Play to expand rings outward from the start.

Graph · BFS · level-order unseen queued active visited
Queue (front → back)
empty
Visit order
none
Step 0 / 0

Press Play. BFS starts by enqueueing the source and assigning it distance 0.

Start Speed
in queue
0
visited
0
max distance
0
progress
0%
timeline0 / 0
←→space walk steps