Pathfinding Visualizer

Click to place start node
Start Node
End Node
Wall
Visited Node
Path Found
Weight Node

Algorithm Controls

Tools

Algorithm Info

Breadth-First Search

Explores all nodes at the present depth before moving on to nodes at the next depth level.

Time Complexity

O(V + E)

Space Complexity

O(V)

Optimality

Guaranteed optimal path

Characteristics

UnweightedComplete