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.
No takes yet. Share an insight, caveat, or question.
Farbey et al. (1967) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: