BFS Shortest Path in an Unweighted Graph
Find the minimum number of edges (and optionally the actual route) between two vertices in an unweighted graph using BFS.
Breadth First Search (Shortest Reach)
Compute shortest distances from a start node in an undirected graph with uniform edge weight using BFS.