The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph

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.