A graph traversal algorithm that explores the neighbor nodes first, before moving to the next level neighbors. It's often used to find the shortest path in an unweighted graph.
Code Editor
The code is for reference. Editing it won't affect the visualization.