Floyd–Warshall algorithm
Statement
All-pairs shortest path; program verification; invariants. Proved in ZFC.
Source
ACM Turing Award 1978. All-pairs shortest path; program verification; invariants. Proved in ZFC.
Domains
computer-science
All-pairs shortest path; program verification; invariants. Proved in ZFC.
ACM Turing Award 1978. All-pairs shortest path; program verification; invariants. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/theorem/floyd-turing-1978/