Same graph, same start node, same alphabetical convention — but a queue instead of a stack. Watch the search ripple outward from A one distance level at a time. The d value under each node is its distance from A.
The current node's entry is highlighted. BFS reads its neighbours left to right — green = processed, amber = already waiting in the queue, white = newly discovered (enqueued now).
Same information, matrix form: read the highlighted row left to right and enqueue every 1 whose column is still white.
——Keyboard: ← → to step · Space to play/pause · R to reset