Breadth-First Search

Watch BFS explore the graph level by level, discovering all nodes reachable from the start before going deeper.

Time: O(V + E)

Space: O(V)

Uses: Queue

Shortest Path: Yes

Start Node:

Speed: 1000ms

Step 1 of 0Infinity%

Unvisited

In Queue

Current

Visited

Queue (front → back):

Empty

Time:O(V + E)

Space:O(V)

Data Structure:Queue

Shortest Path:Yes (unweighted)

Question 1 of 3

What data structure does BFS use to track nodes to visit?

DSAverse

Graph Algorithms

Loading Graph Algorithms...

BFS Traversal

visited: 0 / 7