Algorithm 97: Shortest Path

Communications of the ACM, vol. 5, no. 6, p. 345, 1962
← Back to References

Bibliographic Information

TitleAlgorithm 97: Shortest Path
AuthorsRobert W. Floyd
VenueCommunications of the ACM, vol. 5, no. 6, p. 345
Year1962
Linkhttps://dl.acm.org/doi/10.1145/367766.368168

Summary

The classical O(n^3) APSP algorithm. Works on all graph types but offers no incremental property and no hop-constrained computation — both of which STRATA provides.