single-source shortest-path problem

(classic problem)

Definition: Find the shortest paths from a specific source vertex to every other vertex in a weighted, directed graph. Dijkstra's algorithm solves this if all weights are nonnegative. The Bellman-Ford algorithm handles any weights.

See also graph, all pairs shortest path, single-destination shortest-path problem, DAG shortest paths, shortest path.

Note: Equivalent to the single-destination shortest-path problem with all directions reversed.

Author: PEB

Implementation

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 1 February 2005.
HTML page formatted Fri Mar 25 16:20:35 2011.

Cite this as:
Paul E. Black, "single-source shortest-path problem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 1 February 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/singleSourceShortestPath.html