C# 生成最小生成树——kruskal算法

 public  class kruskal
    {
        public int maxbian = 11;
        public int maxdingdian = 10;
        public struct edge
        {
           public  int vex1;                     //边的起始顶点
           public  int vex2;                      //边的终止顶点
           public  int weight;                    //边的权值

        }
        public   void kruskalmethod(edge []E,int n,int e)

        { int i,j,m1,m2,sn1,sn2,k;

        int []vset = new int[maxdingdian];

          for(i=1;i<=n;i++)        //初始化辅助数组

            vset[i]=i;

        &nb