(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Tue Feb 1 15:45:16 2005.
HTML page formatted Wed Oct 26 09:48:09 2005.
Cite this as:
Paul E. Black, "single-source shortest-path problem", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/singleSourceShortestPath.html
