Editing Dijkstra's algorithm (section)

== References ==

* {{cite book |last1=Cormen |first1=Thomas H. |author1-link=Thomas H. Cormen |title=Introduction to Algorithms |title-link=Introduction to Algorithms |last2=Leiserson |first2=Charles E. |author2-link=Charles E. Leiserson |last3=Rivest |first3=Ronald L. |author3-link=Ronald L. Rivest |last4=Stein |first4=Clifford |author4-link=Clifford Stein |publisher=[[MIT Press]] and [[McGraw–Hill]] |year=2001 |isbn=0-262-03293-7 |edition=Second |pages=595–601 |chapter=Section 24.3: Dijkstra's algorithm}}
* {{cite journal |last=Dial |first=Robert B. |year=1969 |title=Algorithm 360: Shortest-path forest with topological ordering [H] |journal=[[Communications of the ACM]] |volume=12 |issue=11 |pages=632–633 |doi=10.1145/363269.363610 |s2cid=6754003 |doi-access=free}}
* {{cite conference |last1=Fredman |first1=Michael Lawrence |author-link1=Michael Fredman |last2=Tarjan |first2=Robert E. |author-link2=Robert Tarjan |year=1984 |title=Fibonacci heaps and their uses in improved network optimization algorithms |conference=25th Annual Symposium on Foundations of Computer Science |publisher=[[IEEE]] |pages=338–346 |doi=10.1109/SFCS.1984.715934}}
* {{cite journal |last1=Fredman |first1=Michael Lawrence |author-link1=Michael Fredman |last2=Tarjan |first2=Robert E. |author-link2=Robert Tarjan |year=1987 |title=Fibonacci heaps and their uses in improved network optimization algorithms |journal=Journal of the Association for Computing Machinery |volume=34 |issue=3 |pages=596–615 |doi=10.1145/28869.28874 |s2cid=7904683 |doi-access=free}}
* {{cite journal |last1=Zhan |first1=F. Benjamin |last2=Noon |first2=Charles E. |date=February 1998 |title=Shortest Path Algorithms: An Evaluation Using Real Road Networks |journal=[[Transportation Science]] |volume=32 |issue=1 |pages=65–73 |doi=10.1287/trsc.32.1.65 |s2cid=14986297}}
* {{cite book |last1=Leyzorek |first1=M. |title=Investigation of Model Techniques – First Annual Report – 6 June 1956 – 1 July 1957 – A Study of Model Techniques for Communication Systems |last2=Gray |first2=R. S. |last3=Johnson |first3=A. A. |last4=Ladew |first4=W. C. |last5=Meaker, Jr. |first5=S. R. |last6=Petry |first6=R. M. |last7=Seitz |first7=R. N. |publisher=Case Institute of Technology |year=1957 |location=Cleveland, Ohio}}
* {{cite journal |last1=Knuth |first1=D.E. |author-link1=Donald Knuth |year=1977 |title=A Generalization of Dijkstra's Algorithm |journal=[[Information Processing Letters]] |volume=6 |pages=1–5 |doi=10.1016/0020-0190(77)90002-3 |number=1}}
* {{cite journal |last1=Ahuja |first1=Ravindra K. |last2=Mehlhorn |first2=Kurt |last3=Orlin |first3=James B. |last4=Tarjan |first4=Robert E. |date=April 1990 |title=Faster Algorithms for the Shortest Path Problem |url=https://dspace.mit.edu/bitstream/1721.1/47994/1/fasteralgorithms00sloa.pdf |journal=Journal of the ACM |volume=37 |pages=213–223 |doi=10.1145/77600.77615 |s2cid=5499589 |hdl-access=free |number=2 |hdl=1721.1/47994}}
* {{cite journal |last1=Raman |first1=Rajeev |year=1997 |title=Recent results on the single-source shortest paths problem |journal=SIGACT News |volume=28 |issue=2 |pages=81–87 |doi=10.1145/261342.261352 |s2cid=18031586 |doi-access=free}}
* {{cite journal |last1=Thorup |first1=Mikkel |year=2000 |title=On RAM priority Queues |journal=SIAM Journal on Computing |volume=30 |issue=1 |pages=86–109 |doi=10.1137/S0097539795288246 |s2cid=5221089}}
* {{cite journal |last1=Thorup |first1=Mikkel |year=1999 |title=Undirected single-source shortest paths with positive integer weights in linear time |url=http://www.diku.dk/~mthorup/PAPERS/sssp.ps.gz |journal=Journal of the ACM |volume=46 |issue=3 |pages=362–394 |doi=10.1145/316542.316548 |s2cid=207654795 |doi-access=free}}