An Improvement of the Shortest Path Algorithm Based on Dijkstra Algorithm

被引：6
|
作者：
Xiao, Ji-Xian [1 ]
Lu, Fang-Ling [1 ]
机构：
[1] Hebei Polytech Univ, Coll Sci, Tangshan, Peoples R China
来源：
2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 2 | 2010年
关键词：
shortest path; Dijkstra Algorithm; feature matrix; shortest path tree;
D O I：
10.1109/ICCAE.2010.5451564
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, based on the Dijkstra algorithm and its past improvements, a new improvement is proposed by considering the case of the nodes, reforming the feature matrix of precursor node, and adding a shortest path tree. The algorithm has its adantages on both reducing the number of repeated operations and reading the shortest path and the path length from the startpoint to all the other nodes by the shortest path tree or by the feature matrix.
引用
收藏
页码：383 / 385
页数：3
相关论文
共 50 条
  • [41] Autonomous Control of Eye Based Electric Wheel Chair with Obstacle Avoidance and Shortest Path Findings Based on Dijkstra Algorithm
    Arai, Kohei
    Mardiyanto, Ronny
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2011, 2 (12) : 19 - 25
  • [42] A dynamic shortest path algorithm based on an improved ant colony algorithm
    Zhang, S. J.
    [J]. 2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [43] Congested Traffic Based on Ant Colony Algorithm for Shortest Path Algorithm
    Yang Haoxiong
    Hu Yang
    [J]. 2015 INTERNATIONAL CONFERENCE ON LOGISTICS, INFORMATICS AND SERVICE SCIENCES (LISS), 2015,
  • [44] Database system layout algorithm based on CCHDP algorithm of shortest path
    Xing Dong-xu
    Liang Ying
    Zhang Li-feng
    [J]. 2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SCIENCE AND APPLICATION (FCSA 2011), VOL 1, 2011, : 284 - 287
  • [45] A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation
    Misra, J
    [J]. INFORMATION PROCESSING LETTERS, 2001, 77 (2-4) : 197 - 200
  • [46] An improved weighted sum-fuzzy Dijkstra's algorithm for shortest path problem (iWSFDA)
    Dudeja, Chanchal
    Kumar, Pawan
    [J]. SOFT COMPUTING, 2022, 26 (07) : 3217 - 3226
  • [47] Evaluating an Application Aware Distributed Dijkstra Shortest Path Algorithm in Hybrid Cloud/Edge Environments
    Buzachis, Alina
    Celesti, Antonio
    Galletta, Antonino
    Wan, Jiafu
    Fazio, Maria
    [J]. IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, 2022, 7 (02): : 289 - 298
  • [48] Dijkstra's algorithm for shortest path problem using bucket-heap data structure
    Lim, A
    Chong, OW
    [J]. COMPUTER APPLICATIONS IN INDUSTRY AND ENGINEERING, 2000, : 179 - 184
  • [49] An Improved Dijkstra's Algorithm for Shortest Path Planning on 2D Grid Maps
    Li Wenzheng
    Liu Junjun
    Yao Shunli
    [J]. PROCEEDINGS OF 2019 IEEE 9TH INTERNATIONAL CONFERENCE ON ELECTRONICS INFORMATION AND EMERGENCY COMMUNICATION (ICEIEC 2019), 2019, : 438 - 441
  • [50] An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)
    Chanchal Dudeja
    Pawan Kumar
    [J]. Soft Computing, 2022, 26 : 3217 - 3226
12345