An Appraisal of Some Shortest-Path Algorithms

  • Dreyfus S
  • 111


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


This paper treats five discrete shortest-path problems: (1) determining the shortest path between two specified nodes of a network; (2) determining the shortest paths between all pairs of nodes of a network; (3) determining the second, third, etc., shortest path; (4) determining the fastest path through a network with travel times depending on the departure time; and (5) finding the shortest path between specified endpoints that passes through specified intermediate nodes. Existing good algorithms are identified while some others are modified to yield efficient procedures. Also, certain misrepresentations and errors in the literature are demonstrated.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Stuart E. Dreyfus

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free