基于Prim算法最小生成树优化的研究

通过Prim算法的研究寻找局部最优解的迭代过程,用布尔向量U和V-U表示集合中的边,根据权值的关系找到快速有效的算法来构造最小生成树.从理论上分析了算法的性质和时间复杂度.通过实例分析, 证明了该算法有效性并在现实生活中得到的广泛应用.

Research on Optimum of Minimum Spanning Tree Based on Algorithm of Prim

This paper aims at finding the iterative processes of locally optimal solution through studing algorithm of Prim.The solution is to seek an efficient and effective way to construct minimum spanning tree based on the relation of weights by using Boolean vectors and to represent the sides of the congregation.The calculation complexity of algorithm is analyzed in theory.This algorithm is,thus,proven to be effective and applicable in daily life through analysis of examples.