Breadth-First Search (BFS)

Starts at a root node (or source) and explores all neighbors at the present depth before moving on to the nodes at the next depth level.

Category: searching

Enjoy reading code with a tandem explainer?

Explain code with DocComment! Try out your own code!