[Kruskal] POJ 2421

题意:

有N个点的无向图,给了你该图的距离矩阵.且其中一些点已经连接起来了,现在要你求让该无向图连通,你需要添加边的总长度最少是多少?

分析:

将已经连通的边看成是长度为0的边,然后用Kruskal算法处理即可

代码

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int N = 110;
const int M = 20010;

struct Edge {
    int u, v, dis;
    Edge () {}
    Edge ( int u, int v, int d )
        : u ( u )
        , v ( v )
        , dis ( d ) {}

    bool operator< ( const Edge &rhs ) const { return dis < rhs.dis; }
};

struct Kruskal {
    int n, m;
    Edge edges[ M ];
    int fa[ N ];
    int findset ( int x ) { return fa[ x ] == -1 ? x : fa[ x ] = findset ( fa[ x ] ); }

    void init ( int _n ) {
        n = _n;
        m = 0;
        memset ( fa, -1, sizeof ( fa ) );
    }

    void AddEdge ( int u, int v, int dis ) { edges[ m++ ] = Edge ( u, v, dis ); }

    int kruskal () {
        int sum = 0;
        int cnt = 0;
        sort ( edges, edges + m );

        for ( int i = 0; i < m; ++i ) {
            int u = edges[ i ].u, v = edges[ i ].v;
            if ( findset ( u ) != findset ( v ) ) {
                fa[ findset ( u ) ] = findset ( v );
                sum += edges[ i ].dis;

                if ( ++cnt >= n - 1 )
                    return sum;
            }
        }
        return -1;
    }
} KK;

int main () {
    int n;
    scanf ( "%d", &n );
    KK.init ( n );

    for ( int i = 0; i < n; ++i )
        for ( int j = 0; j < n; ++j ) {
            int x;
            scanf ( "%d", &x );
            if ( i < j )
                KK.AddEdge ( i, j, x );
        }

    int q;
    scanf ( "%d", &q );
    while ( q-- ) {
        int u, v;
        scanf ( "%d%d", &u, &v );
        u--, v--;
        KK.AddEdge ( u, v, 0 );
    }

    int sol = KK.kruskal ();
    printf ( "%d\n", sol );

    return 0;
}