What BFS Solves
Given a graph G = (V, E) and a source vertex s, BFS computes shortest-path distances in terms of the number of edges. It is the canonical shortest-path algorithm for unweighted graphs.
Reference: the presentation follows the classic treatment in
Introduction to Algorithms (CLRS).