基于Prim算法的GIS连通性研究

通过分析传统的Prim算法及其数据结构与实现方法,本文提出了一种基于边存储结构和AE的改进Prim算法.改进算法优化并降低了原算法的时间复杂度与空间复杂度,提高了算法的运行效率,并应用于某城市交通网络的最优生成树(MST)的建立,实验分析证明了改进的算法更加适用于GIS海量数据的连通性分析与实现.

Research and implementation of the GIS connectivity based on the Prim aigorithm

The article discussed the algorithm of Prim and its data structure in detail,and advanced an improved algorithm about Prim and AE,on the basis of the storage structure of the side.It implied that the Prim algorithm on the basis of the border consumed much less space,and used up much less time on a certain extent.And the method was applied to get the Minimal Spanning Tree of the traffic network in a city,and it was proved that the method was valuable for analyzing implementing a connectivity scheme for a mass data more easily.