Skip to content
ı
Workspace
Visualizer
Search anything…
⌘ K
Desk
Path
Problems
Review
More
Library
/
Breadth-First Search (BFS)
graphs
Best
O(V + E)
Avg
O(V + E)
Worst
O(V + E)
Space
O(V)
Preparing Breadth-First Search (BFS)...
Explores graph vertices layer by layer using a FIFO queue, finding unweighted shortest paths.