摘要
最短路径算法是计算机科学与地理信息科学等领域研究的热点。文章讨论了一种改进的Dijkstra算法,利用本算法根据用户给出的起始结点、必经点序列和目标结点在GIS的交通层网络图基础上进行路径规划,生成满足一定约束条件的最短路径。实际应用分析表明,改进的Dijkstra算法在提高网络系统空间分析效率方面是可行的。
The shortest path algorithm is a hotspot in the field of Computer Science and geographic information science.This paper discusses a modified Dijkstra algorithm.According to the start point,routing point and target point that the user gives we can plan route in the traffic network graph in GIS,and build the shortest path which satisfies some restrictions with the algorithm.Actual application shows that the modified Dijkstra algorithm is feasible in enhancing the efficiency in network system spatial analysing.
出处
《计算机与现代化》
2004年第9期12-14,17,共4页
Computer and Modernization
