POJ ~ 1287 ~ Networking （最小生成树）

题意：N个点M条边，M行每行u,v,w表示有一条u-v的边边权为w，使N个点都连通的最小花费。

思路：kruskal模板题。

 

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 1005;
int n, m, f[MAXN];
struct Edge
{
    int u, v, w;
    bool operator < (const Edge& A) const
    {
        return w < A.w;
    }
}edge[MAXN];
void init()
{
    for (int i = 0; i <= n; i++) f[i] = i;
}
int Find(int x){ return f[x] == x ? x : f[x] = Find(f[x]); }
int kruskal()
{
    int ans = 0, cnt = 0;
    init();
    sort(edge, edge + m);
    for (int i = 0; i < m; i++)
    {
        int u = edge[i].u, v = edge[i].v, w = edge[i].w;
        int root1 = Find(u), root2 = Find(v);
        if (root1 != root2)
        {
            f[root1] = root2;
            ans += w;
            cnt++;
            if (cnt == n - 1) break;
        }
    }
    return ans;
}
int main()
{
    while (~scanf("%d", &n) && n)
    {
        scanf("%d", &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;
}
/*
1 0

2 3
1 2 37
2 1 17
1 2 68

3 7
1 2 19
2 3 11
3 1 7
1 3 5
2 3 89
3 1 91
1 2 32

5 7
1 2 5
2 3 7
2 4 8
4 5 11
3 5 10
1 5 6
4 2 12

0
*/