全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Improved Dijkstra Shortest Path Algorithm and its Application
改进的Dijkstra最短路径算法及其应用研究

Keywords: Shortest path,Dijkstra's labeled algorithm,Urban transport,Optimal route selection
最短路径
,Dijkstra标号法,城市交通,最优路线选择

Full-Text   Cite this paper   Add to My Lib

Abstract:

The problem of "the shortest path" has wide application.There are many algorithms to solve this problem and the best one is "Dijkstra’s label algorithm".But experiment results show that this algorithm needs to be improved:①The algorithm’s exit mechanism is ineffective to non-unicom figure and will fall into an infinite loop;②The algorithm is not concerned in the problem of previous adjacent vertices in shortest path;③The algorithm is not concerned in the problem that more vertices obtain the "p-label" at the same time.This paper improved the "Dijkstra’s label algorithm".Experiment results indicate that the improved algorithm can solve above problems effectively.On the basis of the above work,we developed the "Beijing Road optimal route selection system",which help users to select the shorted route,so that people can avoid the most congested road traffic and save time.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133