最小生成树 kruskal算法

#include<stdio.h>
#include<algorithm>
struct Edge
{
    int u,v,w;
}edge[10010];
int n,m,sett[110];
int cmp(const struct Edge x,const struct Edge y)
{
    return x.w < y.w;
}
int ffind(int x)
{
    if(x != sett[x])
        x = ffind(sett[x]);
    return x;
}
int kruskal()
{
    int i;
    for(i = 1; i <= n; i++)
        sett[i] = i;
    std::sort(edge, edge+m, cmp);
    int cnt = 0;
    for(i = 0; i < m; i++)
    {
        int x=ffind(edge[i].u);
        int y=ffind(edge[i].v);
        if(x!=y)
        {
            sett[x] = y;
            cnt += edge[i].w;
        }
    }
    return cnt;
}
int main ()
{
    while(~scanf("%d %d",&n,&m))
    {
        for(int i = 0;i < m; i++)
            scanf("%d %d %d",&edge[i].u,&edge[i].v,&edge[i].w);
        printf("%d\n",kruskal());
    }
    return 0;
}