THE LIVING ARCHIVE

From punched cards to autonomous collaborators: the ideas, people, languages and systems that taught machines to follow—and increasingly interpret—human intent.

PAST / PRESENT / NEXT

Collection

Tag: all-pairs-shortest-paths

Floyd-Warshall and All-Pairs Shortest Paths by Dynamic Programming

Floyd-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.

↗