Everything about Dijkstra's algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Dijkstra's algorithmA 5-minute orientation
2. Skim a recent paper: Improved Dijkstra Algorithm for Mobile Robot Path Planning and Obstacle AvoidanceInfluential work since 2022
3. Pick up a classic book: Discrete and combinatorial mathematicsThe most-reprinted book on the subject
4. Read the landmark paper: Fuzzy Dijkstra algorithm for shortest path problem under uncertain environmentCited 357 times
5. Go sideways: Prim's algorithmA closely related topic
6. Go sideways: Johnson's algorithmA closely related topic

🏆 Landmark papers (most cited)

• Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment

  Yong Deng, Yuxin Chen, Yajuan Zhang · 2012 · Applied Soft Computing · 357 citations

• Surface Optimal Path Planning Using an Extended Dijkstra Algorithm

  Min Luo, Xiaorong Hou, Jing Yang · 2020 · IEEE Access · 238 citations

• A biobjective Dijkstra algorithm

  Antonio Sedeño-noda, Marcos Colebrook · 2019 · European Journal of Operational Research · 97 citations

• Prims-Aided Dijkstra Algorithm for Adaptive Protection in Microgrids

  O. V. Gnana Swathika, S. Hemamalini · 2016 · IEEE Journal of Emerging and Selected Topics in Power Electronics · 93 citations

• DIJKSTRA ALGORITHM USING UAV PATH PLANNING

  Elaf DHULKEFL, Akif DURDU, Hakan TERZİOĞLU · 2020 · Konya Journal of Engineering Sciences · 74 citations

• AGV Path Planning based on Improved Dijkstra Algorithm

  Yinghui Sun, Ming Fang, Yixin Su · 2021 · Journal of Physics: Conference Series · 66 citations

• Hybrid Bellman–Ford–Dijkstra algorithm

  Yefim Dinitz, Rotem Itzhak · 2017 · Journal of Discrete Algorithms · 42 citations

• AIS Based Shipping Routes Using the Dijkstra Algorithm

  Pedro Silveira, Ângelo Palos Teixeira, Carlos Guedes Soares · 2019 · TransNav, the International Journal on Marine Navigation and Safety of Sea Transportation · 29 citations

🆕 Influential since 2022

• Improved Dijkstra Algorithm for Mobile Robot Path Planning and Obstacle Avoidance

  Shaher Alshammrei, Sahbi Boubaker, Lioua Kolsi · 2022 · Computers, Materials & Continua · 114 citations

• Path Planning of Rail-Mounted Logistics Robots Based on the Improved Dijkstra Algorithm

  Xiwei Zhou, Jingwen Yan, Mei Yan · 2023 · Applied Sciences · 61 citations

• Airport AGV path optimization model based on ant colony algorithm to optimize Dijkstra algorithm in urban systems

  Yulan Zhou, Nannan Huang · 2022 · Sustainable Computing: Informatics and Systems · 55 citations

• Evaluating an Application Aware Distributed Dijkstra Shortest Path Algorithm in Hybrid Cloud/Edge Environments

  Alina Buzachis, Antonio Celesti, Antonino Galletta · 2022 · IEEE Transactions on Sustainable Computing · 32 citations

• Targeted multiobjective Dijkstra algorithm

  Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño‐Noda · 2023 · Networks · 22 citations

📚 Books worth reading

• Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
• Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000
• Data structures and algorithm analysis in CMark Allen Weiss · 1993
• Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
• Data structures and algorithms in JavaAdam Drozdek · 2001
• Data structures & algorithms in JavaRobert Lafore · 2003
• Algorithm designMichael T. Goodrich, Roberto Tamassia · 2001
• Introductory discrete mathematicsV. K. Balakrishnan · 1991

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Prim's algorithm In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset…
• Johnson's algorithm Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in an edge-weighted directed graph. It allows some of the edge weights…
• Suurballe's algorithm In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed…
• Parallel single-source shortest path algorithm A central problem in algorithmic graph theory is the shortest path problem. One of the generalizations of the shortest path problem is known as the si…
• Floyd–Warshall algorithm In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm)…
• Bellman–Ford algorithm The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph…
• Graph traversal In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph.…
• Contraction hierarchies In computer science, the method of contraction hierarchies is a speed-up technique for finding the shortest path in a graph. The most intuitive applications…