| Given | : | A digraph G = (V, E) in which each arc has a non-negative cost and one vertex is designated as the source. |
| Problem | : | To determine the cost of the shortest path from the source to every other vertex in V (where the length of a path is just the sum of the costs of the arcs on the path). |