摘要
介绍了“地学之窗”中的地理网络模型,以及地理网络中的各种分析方法,详细说明了优化了的Dijkstra算法,该算法充分利用了网络拓扑信息中的弧段的连接关系,避免了使用含有大量无穷值的关联矩阵,使之更适合带有拐向限制设置的最短路径算法和大量结点的实际数据。实践证明,该算法可以节约大量的内存,对于结点数比较大的网络,或带有大量拐向限制设置的网络,具有较好的适用性,在“地学之窗”软件成功地实现了设置拐向限制的最短路径分析功能。
This paper introduces the network model of GeoWin-dows,and various methods of network analysis. The Dijkstra's theory is explained in detail,and it's limitation,which needs geometric series memory with increase of network nodes, is pointed out. The paper emphasizes an optimum algorithm of shortest path-the max adjoin nodes,and its improvement, which takes full advantage of the linking relation of arc section in network topology. This avoids conjunction matrix which includes lots of infinitude and suits huge data which includes turning. It is proved that the method can save lots of memory and suit not only huge network but also network of tuning restriction. On the Geowindows platform, the author designs a geography network model and a date structure. The improved algorithm is applied in the network module analysis, the shortest path analysis with turnine restriction is realized on Geowindows successfully.
出处
《测绘科学》
CSCD
2004年第3期26-29,共4页
Science of Surveying and Mapping
