NIST

single-pair shortest-path problem

(classic problem)

Definition: See shortest path.

Author: PEB

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 2 September 2014.
HTML page formatted Mon May 11 15:07:57 2026.

Cite this as:
Paul E. Black, "single-pair shortest-path problem", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: /HTML/singlepairShortestpathProblem.html