Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

AN ALGORITHM FOR FINDING SHORTEST ROUTES FROM ALL SOURCE NODES TO A GIVEN DESTINATION IN GENERAL NETWORKS

JIN Y. YEN
Quarterly of Applied Mathematics
Vol. 27, No. 4 (JANUARY 1970), pp. 526-530
Published by: Brown University
Stable URL: http://www.jstor.org/stable/43636060
Page Count: 5
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
AN ALGORITHM FOR FINDING SHORTEST ROUTES FROM ALL SOURCE NODES TO A GIVEN DESTINATION IN GENERAL NETWORKS
Preview not available

Abstract

This paper presents an algorithm for finding all shortest routes from all nodes to a given destination in N-node general networks (in which the distances of arcs can be negative). If no negative loop exists, the algorithm requires ½M(N - 1) (N - 2), 1 < M ≦ N - 1, additions and comparisons. The existence of a negative loop, should one exist, is detected after ½N(N - 1)(N - 2) additions and comparisons.

Page Thumbnails

  • Thumbnail: Page 
526
    526
  • Thumbnail: Page 
527
    527
  • Thumbnail: Page 
528
    528
  • Thumbnail: Page 
529
    529
  • Thumbnail: Page 
530
    530