On the shortest route through a network.
ResearchPublished 1959
ResearchPublished 1959
A procedure for finding the shortest route from a given origin to all other nodes in the network or to a particular destination point when little effort is required to arrange distances in increasing order by nodes or to skip consideration of arcs into nodes whose shortest route to the origin has been determined earlier in the computation. It is shown that n(n-1)/2 comparisons are needed to obtain the shortest route from a given origin to all other nodes and less between two fixed nodes.
This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.