algorithms.tutorialhorizon.com
Breadth-First Search/Traversal in a Graph. | Algorithms
Breadth-first search (BFS) is an algo­rithm for tra­vers­ing or search­ing tree or graph data struc­tures. It starts at the tree root and explores the neigh­bor nodes first, before mov­ing to the next level neigh­bors.