Breadth-first Search

Problems on breadth-first search, including shortest paths in unweighted graphs, mazes and grids, knight and other chess-piece moves, flood fill, puzzles where each state is a vertex, and searches that start from several sources at once.

The Graphs section of the library covers breadth-first search, multi-source BFS, 0-1 BFS and graphs of states. Related problem sets are under Shortest paths and Depth-first search.