We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Improvement and Application of Dijkstra Algorithms
PeriodicalsComputer Science & Information Technology

Improvement and Application of Dijkstra Algorithms

Checking your access to this record.

Abstract & Overview

Taking urban express traffic as an example, this paper lists two optimization improvements of Dijkstra algorithm. One is to improve the calculation method of the algorithm to make the calculation more directional, so as to reduce the total amount of calculation. One is in the form of a graphical model, reducing the number of nodes to optimize the calculation process. By comparing the calculation results with the complexity of the traditional algorithm, the effectiveness of the improved method is proved, the complexity of the algorithm is reduced, and the actual work efficiency is improved. It improves the application ability and realizability of Dijkstra algorithm in practical problems.

Cite this record

Heming Bing (2022). Improvement and Application of Dijkstra Algorithms. Academic Journal of Computing & Information Science, 5(5). https://doi.org/10.25236/ajcis.2022.050513

Copy in another style

Bing, H. (2022). Improvement and Application of Dijkstra Algorithms. Academic Journal of Computing & Information Science, 5(5). https://doi.org/10.25236/ajcis.2022.050513
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.