Linked from

The 21 pages that link to Breadth-first search, each with the reason it gives.

• Bipartite graphRelated: Layer parity assigns two colors and detects edges that violate bipartiteness.

• Depth-first searchCompared with: Unlike DFS, it explores a whole frontier before moving to greater depths.

• Dijkstra's algorithmCompared with: It finds shortest paths by edge count when all edges have equal cost.

• Path (graph theory)Related: In an unweighted graph, it finds shortest paths from its starting vertex.

• Tree (graph theory)Related: On a tree, it visits vertices by their distance from the chosen root.

• BacktrackingCompared with: It orders exploration by depth, unlike the deep-branch-first pattern commonly used in backtracking.

• Connected componentRelated: One search discovers all vertices reachable from its starting vertex.

• Topological sortingCompared with: Unlike topological sorting, it orders by distance rather than dependency constraints.

• Adjacency listRelated: It scans each visited vertex's list to enqueue undiscovered neighbors.

• Connected graphRelated: It tests reachability while also finding shortest paths in unweighted graphs.

• Ford–Fulkerson algorithmRelated: Using it to select augmenting paths yields the Edmonds–Karp algorithm.

• Spanning treeRelated: Its discovery edges form a spanning tree organized by distance layers.

• A* search algorithmCompared with: It finds shortest paths only when all edges have equal cost, unlike general-cost A*.

• Odd cycleRelated: BFS layers expose parity conflicts that certify an odd cycle.

• Undirected graphRelated: In an unweighted undirected graph, it finds shortest path lengths from its start.

• Edmonds–Karp algorithmRelated: It finds a residual path with the fewest edges, the defining choice in Edmonds–Karp.

• Bellman–Ford algorithmCompared with: It is simpler and faster when every edge has equal cost.

• Planar separator theoremRelated: Distance layers provide the rings used in common separator proofs.

• MazeRelated: It finds a shortest route when a maze is represented as an unweighted graph.

• Erdős–Gyárfás conjectureRelated: Layering arguments help convert degree conditions into information about cycles.

• Peg solitaireRelated: It can find solutions with the fewest jumps when the state space is manageable.