Breadth-first search is used to calculate the shortest path for an unweighted #graph.

Comments