【算法学习】最小生成树模板

Kruskal算法

模板

const int MAXN = 1010;
const int MAXM = 200020;
struct Edge
{
    int from;   //边的起点
    int to;     //边的终点
    int w;      //权值
}Edges[MAXM];

int father[MAXN];

int find(int x)
{
    if(x != father[x])
        father[x] = find(father[x]);
    return father[x];
}

int cmp(Edge a,Edge b)  //将边按权值排序
{
    if(a.w != b.w)
        return a.w < b.w;   //return a.w > b.w;求最大生成树
    if(a.from != b.from)
        return a.from < b.from;
    return a.to < b.to;
}

int Kruskal(int N,int M)
{
    sort(Edges,Edges+M,cmp);//先将边按权值排序
    int ans = 0,Count = 0;//Count表示合并的变数,ans存放MST大小
    for(int i = 0; i < M; i++)
    {
        int u = find(Edges[i].from);
        int v = find(Edges[i].to);
        if(u != v)
        {
            ans += Edges[i].w;
            father[v] = u;
            Count++;
            if(Count == N-1)//合并了N-1条边，已经找到了最小生成树
                break;
        }
    }
    if(Count == N-1)    //找到最小生成树
        return ans;
    else                //图不连通
        return -1;
}
//初始化及构图
    for(int i = 0; i < N; i++)  
        father[i] = i;  
    Sum = 0;  
    for(int i = 0; i < M; i++)  
    {  
        scanf("%d%d%d",&x,&y,&w);  
        Edges[i].from = x;  
        Edges[i].to = y;  
        Edges[i].w = w;  
        Sum += w;  
    }   
    int ans = Kruskal();