BFS Exploration Monster
Breadth-First Search explores nodes layer by layer using a Queue (FIFO). It guarantees finding the shortest path in unweighted graphs.
0
Visited Nodes
0
Queue Size
0
Total Nodes
0
Traversal Steps
BREADTH-FIRST SEARCH
FIFO Queue (Front ➔ Back)
Queue is empty
Execution Log
Click Run BFS to start. Double click canvas to add nodes. Drag to connect.
🛠️ Graph Controls
Editor mode is active. Double click on canvas to add nodes. Drag from one node to another to create directed edges.
⚡ Traversal Complexity
Time Complexity
O(V + E)
Space Complexity
O(V)