# single-destination shortest-path problem

(classic problem)

**Definition:**
Find the shortest *path* from each *vertex* in a *weighted, directed graph* to a specific destination vertex.

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

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

Author: PEB

## Implementation

See implementations at graph.

Go to the
Dictionary of Algorithms and Data
Structures home page.

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

Entry modified 17 December 2004.

HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:

Paul E. Black, "single-destination shortest-path problem", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/singleDestShortestPath.html