Upgrading Shortest Path Problems

Authors

  • Shra Fatima Department of Computer Science & Engineering, Integral University, Lucknow, Uttar Pradesh, INDIA
  • Kamlesh Chandra Maurya Department of Computer Science & Engineering, Integral University, Lucknow, Uttar Pradesh, INDIA

DOI:

https://doi.org/10.31033/ijemr.13.3.34

Keywords:

Dijkstra Algorithm, Dijkstra’s Label Algorithm, P-Lables, Shortest Path

Abstract

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

Download data is not yet available.

Downloads

Published

2023-06-30

How to Cite

Shra Fatima, & Kamlesh Chandra Maurya. (2023). Upgrading Shortest Path Problems. International Journal of Engineering and Management Research, 13(3), 248–251. https://doi.org/10.31033/ijemr.13.3.34

Issue

Vol. 13 No. 3 (2023): June Isue

Section

Articles

License

Copyright (c) 2023 Shra Fatima, Kamlesh Chandra Maurya

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.