Tag Archives: Edsger Dijkstra

Dijkstra's algorithm

Dijkstra's algorithm for finding the shortest paths in a graph is a classical one that most students of computer science get to learn about, although I suspect few have actually read the original paper. Published in the very first volume of the journal Numerische Mathematik in 1959, an official copy of the three-page paper A Note on Two Problems in Connexion with Graphs is available from SpringerLink, although you would have to be at an academic institution with a subscription or have a personal subscription to SpringerLink to download the paper.

Continue reading Dijkstra's algorithm