对任意给定的网络（顶点数和边数自定），建立它的邻接矩阵并输出，然后利用Prim算法或Kruskal算法生成它的最小生成树，并输出结果。-On any given network (the number of vertices and edges from the set), the establishment of its adjacency matrix and output, and then use Prim algorithm or Kruskal algorithm to generate its minimum spanning tree, and output results.