摘要
文中从城市道路网络的特点出发 ,分析了道路路段间的连通关系 ,得出一种求城市道路网络两节点间的最短路径的算法 .算法的复杂度与网络节点数 N成线性关系 ,即 O(N) .最后通过在 GIS软件 Map Info中编制的算法程序实例 。
This article discusses a new algorithm which gets the shortest path between two points in a city's road net. This algorithm is based on the geographic relevance relationship among roads in the road net. The presented algorithm's complexity is just proportion to the number of nodes in the road net while conventional shortcut algorithm's complexity is proportion to the power of the number of nodes. At the end of the article, it provides some instance which prove that the algorithm is applied and reliable.
出处
《计算机学报》
EI
CSCD
北大核心
2000年第2期210-215,共6页
Chinese Journal of Computers
