小生成树其实是最小权重生成树的简称。一个有n个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有n个结点，并且有保持图连通的最少的边。最小生成树可以用kruskal（克鲁斯卡尔）算法或Prim（普里姆）算法求出。(The young adult tree is actually the abbreviation of the minimum power regeneration. The spanning tree of a connected graph with n nodes is the minimal connected subgraph of the original graph, and contains all n nodes in the original graph, and has the least edge to keep the graph connected. The minimum spanning tree can be obtained using kruskal (kruskal) algorithm or Prim (Prim) algorithm.)