← ~/visualizations

breadth-first-search

A tree being traversed breadth-first. Nodes light up level by level: all siblings before children.

canvasclick to interact
t=0s

practical uses

  • 01.Teaching BFS algorithm
  • 02.Explaining queue-based traversal
  • 03.Finding shortest paths in unweighted graphs
  • 04.Level-order tree processing

technical notes

7-node binary tree. Circular nodes to distinguish from DFS visual. BFS order: 0,1,2,3,4,5,6.