摘要
Dijkstra算法是求解嵌入式GIS系统中最短路径的经典算法,通过对Dijkstra算法进行分析,改变图的存储结构和搜索方法,采用基于矩形限制区域的二叉排序树改进算法,减少了内存存储空间,缩短了查询时间,在一定程度上优化了最短路径的计算过程,实际数据测试也表明了该算法的有效性。
Dijkstra algorithm is a classic algorithm to solve the shortest path in the embedded GIS system.Changing the storage structure of the graphics and the search method,Dijkstra algorithm is modified by using binary sort tree based on rectangle boundary area through analyzing algorithm.The memory space needed is decreased and the search time is shortened and the algorithm has optimized calculation process in some degree.The algorithm is achieved good results by testing some data.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第31期209-211,共3页
Computer Engineering and Applications
基金
江苏省高校自然科学研究计划项目基金(No.10KJD520008)
青蓝工程资助
