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: greedy-algorithm

Edsger Dijkstra and the Shortest-Path Algorithm: Greedy Choice on a Graph

Edsger Dijkstra's shortest-path algorithm repeatedly finalizes the nearest reachable vertex, turning weighted-route search into a disciplined greedy process with a provable invariant.

↗