+Breadth-First Search (BFS) systematically explores a [graph](/wiki/graph) or [tree](/wiki/tree) layer by layer. Starting from a root, it visits all immediate neighbors before moving to their neighbors, finding the shortest path in unweighted structures.
+## See also
+- [Depth First Search](/wiki/depth_first_search)
+- [Graph](/wiki/graph)
+- [Algorithm](/wiki/algorithm)
... 1 more lines