Finding All Shortest Distances in a Directed Network
Alan J. Hoffman, Shmuel Winograd · IBM Journal of Research and Development · 1972
A new method is given for finding all shortest distances in a directed network. The amount of work (in performing additions, subtractions, and comparisons) is slightly more than half of that required in the best of previous methods.