摘要
文章从目前最常见的两种在图最小生成树算法，即Prim和Kruskal算法，展开了阐述和分析，运用了大量的数据和实例对这两种计算方法进行了分析和研究。通过试验并对Prim算法进行改进，从图中每个顶点的度数入手，采取删除某些无用边的思想方法，给出了一个寻找最小生成树的算法，使其能动态调整自身的性能，既适合于稠密图，又适合于稀疏图。
In the minimum spanning tree algorithm of graph, Prim and Kruskal algorithm are respectively applied to dense graph and sparse graph. But both cannot dynamically regulate their own capability based on peak number, edge number and edge distribution. Prim starts from the degree of the vertex and then delete some useless edges from the graph. Therefore, improvement on the Prim algorithm,enabling it dynamically regulates its capability, Can be applied to both dense graph and sparse graph.
出处
《计算机光盘软件与应用》
2010年第3期95-95,94,共2页
Computer CD Software and Application
