Edsger W. Dijkstra was a computer scientist whose work includes the Dijkstra algorithm for shortest paths with nonnegative edge weights. Its key step finalizes the unsettled vertex with the smallest tentative distance; nonnegative edge weights ensure that a later route cannot improve that distance.[ref]
The same short paper also treated the minimum spanning tree problem. The distinction is instructive: minimizing the total weight of a connecting tree differs from minimizing routes from a source. Dijkstra later recalled devising the shortest-path example for a 1956 computer demonstration using a simplified Dutch railway map, a concrete explanation of the computational task for a general audience.[ref]
Reflections on A Note on Two Problems in Connexion with Graphs by Edsger W. Dijkstra. EWD841a, recollection of the 1956 demonstration
Portrait of Edsger W. Dijkstra
. Hamilton Richards. CC BY-SA 3.0, via Wikimedia Commons. Source. Articles by others on the same topic
Edsger W. Dijkstra was a prominent Dutch computer scientist, widely regarded for his contributions to the fields of computer programming, algorithms, and software engineering. Born on May 11, 1930, and passing away on August 6, 2002, Dijkstra is best known for several key concepts and innovations in computing.