1.   As a by-product it also finds the shortest paths from s to all other vertices in the graph.

2.   The algorithm works by progressively updating a label D assigned to each vertex u until D becomes equal to the shortest path length from s to u.

3.   Dynamic programming is used to compute a shortest path between every pair of vertices in a weighted directed graph G.

4.   This algorithm does not require all edge weights to be positive, but we have to ban negative length cycles.

5.   Strogatz and Watts began looking around for networks in which every connection was known, allowing them to determine the shortest possible path between any two points.

6.   Western diplomats are reluctant to abandon a four-year-old accord in Angola, saying it still represents the shortest path to peace.