摘要
最短路径算法是地理信息科学与计算机科学等领域的研究热点。本文从网络分析的理论基础及拓扑性质出发,提出了一种适于最短路径算法的空间数据组织方式。结合道路网络的特点,在构造邻接结点矩阵来表达网络结构的基础上,运用优化的迪杰斯特拉(Dijkstra)最短路径算法,在电子地图环境下实现了道路网络中任意两结点间最短路径的快速解算与刷新。
The algorithm for the shortest path is a study hotspot in geographical information system, computer science and etc. Based on the theories of network analysis and topology, a new method of spatial data structure for the algorithm which is suitable for with Dijkstras optimizing method and combined with the characteristics of route network so that it realized a way of speed resolving and updating the shortest path between any two crunodes of route network in the environment of electronic maps.
出处
《辽宁工程技术大学学报（自然科学版）》
CAS
北大核心
2003年第2期180-181,共2页
Journal of Liaoning Technical University (Natural Science)
