01Floyd-Warshall and All-Pairs Shortest Paths by Dynamic ProgrammingFloyd-Warshall turned all-pairs shortest paths into a compact dynamic program: allow intermediate vertices one by one and update a distance matrix in cubic time.↗