Given an n-node network with lengths associated with arcs: the problem is to find the shortest paths between every pair of nodes in the network. If the network has less than n(n-1) arcs, then it is ...

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