The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
- 1 September 1967
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 14 (1) , 19-28
- https://doi.org/10.1287/mnsc.14.1.19
Abstract
Matrix methods for finding shortest distances are convenient and efficient when the lengths of shortest paths are wanted between all pairs of vertices in a graph. The Cascade algorithm requires substantially fewer operations to find these distances than does the standard matrix method.Keywords
This publication has 0 references indexed in Scilit: