Breadth-First Search (BFS) Visualization
Explore graph vertices level by level using a queue-based approach
Add Vertex
Add Edge
Graph Visualization
Add vertices and edges to create a graph, then run BFS!
BFS Traversal Path
Graph Statistics
Vertices: 0
Edges: 0
Visited: 0
Max Level: 0
Legend
Unvisited Vertex
Current Vertex
Visited Vertex (Level Color)
Shortest Path
BFS Algorithm Properties
Time Complexity
O(V + E)
Space Complexity
O(V)
Data Structure
Queue
Use Cases
Shortest path, Level traversal