From counting boards and the first algorithms to deep learning: the theory, machines, languages, algorithms, systems, networks, software practice, security and AI that make up computer science, in calendar dates. Moments are tagged and colored by subfield; eras are shown as spans, and links connect ideas to what they led to. Summaries are original; each moment links to its Wikipedia articles as sources. Dates marked approximate say so.
Duration correction: Ongoing subjects previously drawn through a present/research cutoff are represented at their original starts, with no end asserted. Existing moments at those coordinates are reused; their attached cards retain the former duration’s notes, sources, tags and media. Bounded historical and coverage intervals remain durations.
88 moments · 2700-07 BCE – 2022-11-30 CE · by @athan · @athan
Dijkstra's shortest-path algorithm
algorithms
Edsger Dijkstra published his shortest-path algorithm in 1959. For a graph with nonnegative edge weights, it repeatedly settles the closest not-yet-finalized vertex and updates candidate distances to its neighbors. This disciplined choice makes it possible to compute shortest routes without enumerating every possible path. The algorithm became fundamental in network routing, transport planning and graph software. Its guarantees depend on the problem’s assumptions, especially nonnegative weights; a graph with negative edges needs different handling. The milestone concerns a general algorithmic method rather than one particular navigation device or network. **Timeline anchor:** 1 January 1959 CE. **References:** [Source 1](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm).