摘要
从路径冗余角度研究了传统Dijkstra算法中的"交会路径"和"循环路径"问题,并针对上述问题提出了一种Dijkstra算法改进方法。该方法优化了路径搜索空间,降低了原算法的时间复杂度和空间复杂度,提高了算法的运行效率。最后,通过实验对该改进算法进行了验证。
From the perspective of the path redundancy, focused on ＂Intersection Path＂ and ＂Loop Path＂ problems in Dijkstra algorithm, the paper proposed an improvement method of Dijkstra algorithm according to these problems. This method could optimize the path search space, decrease the original algorithm＇ s time complexity and space complexity, and enhance the efficiency of the al- gorithm. And finally, the algorithm was validated through experiment.
出处
《测绘科学》
CSCD
北大核心
2011年第4期233-235,共3页
Science of Surveying and Mapping
基金
"十一五"国家科技支撑计划重大项目(2006BAJ05A13)
