Instructions: Choose a graph and a source node, then click the buttons (or press the ← and → keys) to step through a breadth-first search one iteration at a time. As in lecture, each node is undiscovered, pending, or visited and a node's neighbors are produced in sorted order. The node being visited is circled, and the edges it explores are drawn in bold. Under Options, you can run a full BFS, step through one edge at a time, or show shortest paths. With Show shortest paths checked, each discovered node shows the distance BFS recorded for it, and a bold purple arrow points to it from its BFS predecessor.