摘要
将Dijkstra的最短路径算法应用到交通运输,对用户出行的路线选择提供指导。将现实中跟地理位置有关的数据转变为适合算法处理的数据结构,并对原有算法进行了存储结构方面的改进。计算路段的权值时不仅仅考虑其长度,而且考虑到了拥塞状况,加入了动态变化的拥塞系数,使这一权值更加合理。
The paper applies Dijkstra＇s the shortest path algorithm to transportation in order to provide path selection guidance for travelers.It translates location-related data in reality to data structure which is suitable for algorithmic processing and improves the storage structure of the original algorithm.When calculating section weights,it not only considers their length,but also thinks over their congestion status and takes into account the dynamic congestion factors to make the weights more reasonable.
出处
《计算机应用与软件》
CSCD
2011年第9期298-300,共3页
Computer Applications and Software
关键词
最短路径
路径选择
交通导航
Shortest path Path selection Traffic navigation
