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 E. Black.

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

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

to NIST home page