An Improved Dijkstra Shortest Path Algorithm

摘要：

　　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.

关键词： Dijkstra algorithm Shortest path Constraint function

作者: Yizhen Huang Qingming Yi Min Shi

作者单位: College of Information Science and Technology,Jinan University Guangzhou,China

会议类型: 国际会议

会议名称: 2013 2nd International Conference on Computer Science and Electronics Engineering(ICCSEE2013)(2013年第二届计算机科学与电子工程国际会议)

会议地点: 杭州

会议语种:英文

页码: 226-229

在线出版日期: 2013-03-22（万方平台首次上网日期，不代表论文的发表时间）