This game helps you understand Breadth-First Search (BFS), an algorithm for traversing graphs.
BFS visits nodes level by level, starting from a source node and exploring all neighbors before moving to the next level.
help - Show available commands
reset - Reset the graph to its initial state
bfs <node> - Run BFS from the specified node
step - Step through BFS execution
path <node> - Show shortest path to node
new - Generate a new random graph
🔵 Blue - Normal node
🟢 Green - Visited node
🟠Orange - In queue
🔴 Red - Selected node