Identifying breadth-first search for shortest path

The breadth-first search can solve the shortest path problems for unweighted graphs. These are generally medium or hard problems where we need to find the shortest distance between any pair of nodes. While there may be other ways to solve such problems, they are usually less efficient and more complicated to implement.

If the problem statement or its solution follows the generic template below, it can be solved by applying the breadth-first search algorithm.