Concepts
Dijkstra's Algorithm
DYKE-struhz algorithm
Also Known As Dijkstra's Shortest Path Algorithm
Algorithm
Citation Formats
General Reference
APA Style
BibTeX
Dijkstra's algorithm finds the shortest paths between nodes in a weighted graph, which is the abstract form of questions like the fastest road between two cities or the cheapest route through a network. Edsger W. Dijkstra conceived it in 1956, while working as a programmer at the Mathematical Center in Amsterdam, and published it in 1959; it remains a first week staple of every algorithms course and a working part of routing systems everywhere.
Facts
Origin YearConceived in 1956; published three years later, in 1959. Core PrincipleGrow the set of nodes whose shortest distance is settled, always extending it through the nearest unsettled node, until the destination is reached. 1 Cross-Tradition Connections
Sources
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.
View At A Past Year
The atlas records no dated fact of its own for this entry, so there is no other year to choose.