Upgrading Shortest Path Problems
DOI:
https://doi.org/10.31033/ijemr.13.3.34Keywords:
Dijkstra Algorithm, Dijkstra’s Label Algorithm, P-Lables, Shortest PathAbstract
There are several areas where the shortest path problem exists.One well-known algorithm is the Dijkstra Algorithm.The "Dijkstra Algorithm" has one flaw, according to the results of the experiments, namely that it doesn't deal with the issue of adjacent vertices in the shortest path.The algorithm has seen substantial improvement. The findings of our trial show that the problem has been successfully fixed.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Shra Fatima, Kamlesh Chandra Maurya
This work is licensed under a Creative Commons Attribution 4.0 International License.
Research Articles in 'International Journal of Engineering and Management Research' are Open Access articles published under the Creative Commons CC BY License Creative Commons Attribution 4.0 International License http://creativecommons.org/licenses/by/4.0/. This license allows you to share – copy and redistribute the material in any medium or format. Adapt – remix, transform, and build upon the material for any purpose, even commercially.
