POJ ~ 1258 - Agri-Net （最小生成树）

题意：有N个点，给出邻接矩阵表示边权，求最小生成树。

思路：kruskal套上就过了。

 

 

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 1005;
const int MAXM = 1005 * 1005;
int n, m, f[MAXN], G[MAXN][MAXN];
struct Edge
{
    int u, v, w;
    bool operator < (const Edge& A) const
    {
        return w < A.w;
    }
}edge[MAXM];
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()
{
    init();
    sort(edge, edge + m);
    int ans = 0, cnt = 0;
    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))
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                scanf("%d", &G[i][j]);
            }
        }
        m = 0;
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (i == j) continue;
                edge[m].u = i; edge[m].v = j; edge[m].w = G[i][j];
                m++;
            }
        }
        printf("%d\n", kruskal());
    }
    return 0;
}
/*
1
3
10 20 30
0 100 200
100 0 300
200 300 0
*/