摘要
针对应急交通中寻找最短路径的重要性和对时间要求的严格性,在分析传统Dijkstra算法特征的基础上,对Dijkstra算法从两个方面进行了改进,并将改进后的算法应用于应急交通系统中快速搜索最短路径,实践证明改进后的算法在时间上优于传统的Dijkstra算法.
At the problem of the importance of finding the shortest path in the emergency transportation and strict time requirements,based on the analysis about the characteristics of the traditional Dijkstra algorithm,we improved the Dijkstra algorithm from two aspects,and the improved algorithm is applied to the traffic emergency system quickly searching the shortest path,the results show that the improved algorithm outperforms the Dijkstra algorithm in time.
出处
《泰山学院学报》
2013年第6期65-68,共4页
Journal of Taishan University
关键词
最短路由算法
出度
入度
算法效率
shortest routing algorithm
out-degree
in-degree
the efficiency of algorithm
