An Improved Dijkstra Shortest Path Algorithm

DOI

10.2991/iccsee.2013.59How to use a DOI?

Keywords

Dijkstra algorithm, Shortest path, Constraint function

Abstract

An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity. The simulation experiment results show that the number of nodes on search shortest path and computation time is significantly reduced. Thus, improved algorithm can be faster to search out the target nodes.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yizhen Huang
AU  - Qingming Yi
AU  - Min Shi
PY  - 2013/03
DA  - 2013/03
TI  - An Improved Dijkstra Shortest Path Algorithm
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 226
EP  - 229
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.59
DO  - 10.2991/iccsee.2013.59
ID  - Huang2013/03
ER  -