Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½N3 Additions and N3 Comparisons

Abstract

A (computer programming) algorithm is presented which is based on Dijkstra's principle for finding the lengths of all shortest paths from either a fixed node or from all nodes in N-node nonnegative-distance complete networks. This algorithm is more efficient than other available (computer programming) algorithms known to the author for solving the above two problems. An empirical study on a computer has confirmed its superiority. © 1972, ACM. All rights reserved.