Although several early sources called it “Minty’s algorithm,” this approach is now universally known as “Dijkstra’s algorithm,” in full accordance with Stigler’s Law.
A nearly identical algorithm was also described by George Dantzig in 1958.
The same algorithm was independently discovered by Edsger Dijkstra in 1956 (but not published until 1959), again by George Minty sometime before 1960, and again by Peter Whiting and John Hillier in 1960. If we replace the FIFO queue in breadth-first search with a priority queue, where the key of a vertex v v v is its tentative distance d i s t ( v ) dist(v) d i s t ( v ), we obtain an algorithm first published in 1957 by a team of researchers at the Case Institute of Technology led by Michael Leyzorek, in an annual project report for the Combat Development Department of the US Army Electronic Proving Ground. Proof of tenseness property in Dijkstra’s algorithm
