最小生成树就是：

　 在所有数据满足是一棵树的情况下一条将所有节点都连接起来且长度最短的一条路（因为任意两个节点之间有权值

（相连的两点之间权值为一个具体的数，不相连的两个点之间权值为无穷大））

下面介绍通用的求最小生成树的两种算法：(The smallest spanning tree is:

When all data satisfy a tree, a path that connects all nodes is the shortest one, because there is any weight between two nodes.

The weight between two points is a specific number. The weights between the two points are infinite.

Here are two general algorithms for finding minimum spanning tree.)