摘要
最短路径分析是G IS地理网络分析功能中的一个关键问题。D ijkstra算法是计算最短路径的经典算法,在对该算法分析的基础上,提出了基于面向对象的改进算法,大大降低了内存消耗,搜索效率明显提高。讨论了地理网络的数据存储结构和最短路径算法的具体实现,并通过实例验证表明,该算法是有效可行的。
Shortest path analysis is the key problem of network analyses. Dijkstra algorithm is a classic arithmetic for the shortest path. Based on analyzing the algorithm, this paper presents improved algorithm based on object- oriented, the improved algorithm saves much memory and greatly improves the efficiency of searching. Furthermore,it discusses the topological structure of geographical network data and the detailed implementing steps of the shortest path , and proves that the method is effective and practicable by the instance.
出处
《计算机与数字工程》
2006年第12期53-56,共4页
Computer & Digital Engineering
