Editing Shortest path problem (section)

==Further reading==
*{{cite book
 |last=Altıntaş
 |first=Gökhan
 |date=2020
 |title= Exact Solutions of Shortest-Path Problems Based on Mechanical Analogies: In Connection with Labyrinths
 |url=https://books.google.com/books?id=oSvHzQEACAAJ
 |publisher= Amazon Digital Services LLC
 |isbn= 9798655831896
}}
* {{cite conference |title=Fully dynamic output bounded single source shortest path problem |first1=D. |last1=Frigioni |first2=A. |last2=Marchetti-Spaccamela |first3=U. |last3=Nanni |year=1998 |book-title=Proc. 7th Annu. ACM-SIAM Symp. Discrete Algorithms |pages=212–221 |location=Atlanta, GA |citeseerx = 10.1.1.32.9856}}
* {{cite report |last=Dreyfus |first=S. E. |title=An Appraisal of Some Shortest Path Algorithms |date=October 1967 |id=RM-5433-PR |publisher=United States Air Force |series=Project Rand |url=http://apps.dtic.mil/dtic/tr/fulltext/u2/661265.pdf|archive-url=https://web.archive.org/web/20151117014431/http://www.dtic.mil/dtic/tr/fulltext/u2/661265.pdf|url-status=live|archive-date=November 17, 2015}} DTIC AD-661265.

{{Graph traversal algorithms}}
{{Authority control}}

[[Category:Network theory]]
[[Category:Graph distance]]
[[Category:Polynomial-time problems]]
[[Category:Computational problems in graph theory]]
[[Category:Edsger W. Dijkstra]]