WEBApr 1, 2023 · Breadth-First Search. Published Apr 1, 2023 • Updated Apr 6, 2023. Contribute to Docs. Breadth-first search (BFS) is a traversing algorithm for unweighted graphs. This is a foundational algorithm in graph theory from which many other algorithms start. Features.
