Breadth-First Search (BFS) systematically explores a graph or 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 Graph Algorithm Pathfinding