🔵 BFS — Breadth-First Search
USACO C++ Book · Interactive Visualizer
🔵 BFS — Breadth-First Search Full Demo
Graph Traversal
O(V+E)
Step 0/9
📊 Graph
🗂 Data Structures
Queue
Visited
dist[] Distance
Time:
O(V+E)
Space:
O(V)
(queue)
💻 Code
Hint
Click
Next Step ▶
to start and observe the graph, queue, distance array, and code update in sync.
◀ Prev
Next Step ▶
↺ Reset
0/9
Keyboard:
→
Next
←
Prev
R
Reset