最小生成树

# include<iostream>
# include<string>
# include<string.h>
# include<queue>
# include<stdio.h>
# include<math.h>
#include <algorithm>
#define INF 10000001
using namespace std;
int edge[505][505];
int v,e,h=1,sum = 0,ct=0;
int vertex[505];    //vertex[i] 表示最小生成树的顶点集合 
int temp[505];
int ans[10001];
/*
struct MINI
{
    int v,w;
}mini[505][3];    //mini[i][0] 表示编号为i的顶点的v,w ,用于存储一个顶点的所有权值 
bool cmp(MINI x,MINI y)
{
    return x.w<y.w;
} */
int Prim()
{
    
    while(h<v)
    {
        int MINW = INF;
        int MINV = -1;
        int MINU = -1;
        int i,j;
        for(i=1;i<=h;i++)
        {
            int start = vertex[i]; 
            for(j=1;j<=v;j++)
            {
            
                if(j!=start && edge[start][j]<=MINW && edge[start][j]!=INF)
                {
                    for(int p=1;p<=h;p++)
                    {
                        if(vertex[p]==j)    //如果即将加入的顶点 已经在最小生成树顶点集合中  则重新寻找   以免形成回路 
                            continue; 
                    } 
                    
                    //printf("%d %d %d\n----------------\n",MINU,MINV,MINW);
                    MINW = edge[start][j];
                    MINU = start;
                    MINV = j;
                    //printf("%d %d %d\n----------------\n",MINU,MINV,MINW);
                }
            }
        }
        //printf("####################################################\n");
        h++;
        vertex[h] = MINV;
        sum += MINW;
        edge[MINU][MINV] = INF;
        edge[MINV][MINU] = INF;
    }
    return sum;
}
int main()
{
    int m,n,i,j,t;
    cin>>t;
    while(t--)
    {
        cin>>v>>e;
        for(i=1;i<=e;i++)
            for(j=1;j<=e;j++)
                edge[i][j]=INF;
        for(i=1;i<=v;i++)
            vertex[i]=0;
        for(i=1;i<=10001;i++)
            sum[i]=0;
        for(i=1;i<=e;i++)
        {
            int a,b,c;
            scanf("%d %d %d",&a,&b,&c);
            edge[a][b] = c;
            edge[b][a] = c;
        }
        vertex[1] = 1;
        h = 1;
        sum = 0;
        int k = Prim();
        printf("%d",k);
    } 
    return 0;
}