这是一个图论问题中最小生成树的一种构造算法。

按普里姆算法构造最小生成树的过程为：在所有“其一个顶点已经落在生成树上，而另一个顶点尚未落在生成树上”的边中取一条权值为最小的边，逐条加在生成树上，直至生成树中含有 n-1条边为止。

-This is a problem in graph theory, a minimum spanning tree construction algorithm. Primm constructed by the minimum spanning tree algorithm process as follows: in all, " has landed one of its vertex spanning tree, while yet another vertex spanning tree falls on the"　take a side in the right side is the smallest, one by one added to the spanning tree, until the spanning tree contains n-1 edges so far.