Back to Algorithms
Reset Visualization
Breadth-First Search
A graph traversal algorithm that explores neighbor nodes at the present depth prior to moving on to nodes at the next depth level.
Graph Traversal
Shortest Path
Unweighted
Visualization
Information
Controls
Run
Play
No data
Select start and end nodes on the graph.