Breadth-First Search

Breadth-First Search (BFS) traverses a graph systematically level by level starting from the root or source node. It utilizes a First-In-First-Out (FIFO) queue to track unexplored neighbor nodes.

Category:Uninformed Search

•

Difficulty:Beginner

•

Time complexity:O(V + E)

•

Space complexity:O(V)

Interactive visualizationBFS Visualizer

Edit mode: Click/drag to draw walls, drag Start (S) or Goal (G)

Start / Goal Wall Visited Frontier Path

0 / 0

Speed:

Nodes Explored0

Frontier Size0

Path Cost g(n)—

Total Steps0

No step trace active. Click "Visualize A*" to begin algorithm execution.