concept Dijkstra 's algorithm in category algorithms
appears as: Dijkstra's algorithm, Dijkstra's algorithms

This is an excerpt from Manning's book Algorithms and Data Structures in Action.
BFS, as we have seen, uses a clear strategy to traverse a graph: it starts from the closest vertices to a source, and the it propagates in all directions like a wave, in concentric rings, first all the vertices at distance 1, then the next ring, with all the vertices at distance 2, etc...