POJ 1287

#include<iostream>
#include<stdio.h>
#define MAXN 100
#define inf 1000000000
using namespace std;
int _m[MAXN][MAXN];
int pre[MAXN];
int low_cost[MAXN];
int prime(int n);
int main()
{
//    freopen("acm.acm","r",stdin);
    int point;
    int edge;
    int i;
    int j;
    int u;
    int v;
    int temp;
    while(cin>>point>>edge)
    {
        for(i = 0; i < point; ++ i)
        {
            for(j = 0; j < point; ++ j)
            {
                _m[i][j] = inf;
            }
        }
        for(i = 0; i < edge; ++ i)
        {
            cin>>u>>v;
            --u;
            --v;
            if(_m[u][v] == 0)
            {
                cin>>_m[u][v];
                _m[v][u] = _m[u][v];
            }
            else
            {
                cin>>temp;
                if(_m[u][v] > temp)
                {
                    _m[u][v] = temp;
                    _m[v][u] = temp;
                }
            }
        }
        cout<<prime(point)<<endl;
    }
}


int prime(int n)
{
    int i;
    int j;
    int k;
    int sum = 0;
    int min;
    for(i = 1; i < n; ++ i)
    {
        low_cost[i] = _m[0][i];
        pre[i] = 0;
    }
    for(i = 1; i < n; ++ i)
    {
        min = inf;
        for(j = 1; j < n; ++ j)
        {
            if(low_cost[j]&&low_cost[j] < min)
            {
                k = j;
                min = low_cost[j];
            }
        }
        sum += low_cost[k];
        low_cost[k] = 0;
        for(j = 1; j < n; ++ j)
        {
            if(_m[k][j] < low_cost[j] && low_cost[j])
            {
                low_cost[j] = _m[k][j];
                pre[j] = k;
            }
        }
    }
    return sum;
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。 

技术网站地址： vmfor.com