Tag: robert-floyd

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.

Heapsort joined a compact tree-shaped data structure with an in-place sorting procedure. Williams introduced the core idea in 1964, and Floyd quickly supplied an efficient construction and implementation pattern close to the one still taught today.

Robert Floyd's assertion method turned program correctness into a mathematical problem by attaching logical conditions to control flow and proving that execution preserves them.