08-图7 公路村村通 (30分)

08-图7 公路村村通 (30分)

#include <iostream>
using namespace std;
#define INFINITY 63325
#define MaxSize 1005
#define ERROR -1
int Dist[MaxSize];//distance from MST to Node
int Map[MaxSize][MaxSize];//a matrix which is used to restore city numbers and path numbers
int TotalCost=0;//minimun value of the cost
int CityNums,PathNums;

int Prim();
int FindMinDist();
int main()
{
    cin >> CityNums >> PathNums;
    int i,j;
    int V1,V2,Weight;
    for(i = 1;i<=CityNums;i++)
        for(j=1;j<=CityNums;j++)
        {
            if(i==j) Map[i][j]=0;
            else Map[i][j] = INFINITY;
        }
    for(i=0;i<PathNums;i++)
    {
        cin>>V1>>V2>>Weight;
        Map[V1][V2]=Weight;
        Map[V2][V1]=Weight;
    }
    cout<<Prim();
    return 0;
}
int Prim()
{
    int i,j,v;
    //begin at City1 and find pathes which are connected with City1
    for(i=1;i<=CityNums;i++)
        Dist[i]=Map[1][i];
    Dist[1]=0;
    //find minimum value of pathes
    for(i=1;i<CityNums;i++)
    {
        v=FindMinDist();
        if(v)
        {
            TotalCost+=Dist[v];
            Dist[v]=0;
            for(j=2;j<=CityNums;j++)
            {
                if(Dist[j]!=0&&Map[v][j]<Dist[j])
                    Dist[j]=Map[v][j];
            }
        }else return ERROR;
    }
    return TotalCost;
}
int FindMinDist()
{
    int MinV=0,MinDist=INFINITY;
    int i;
    for(i=1;i<=CityNums;i++)
    {
        if(Dist[i]!=0&&Dist[i]<MinDist)
        {
            MinDist = Dist[i];
            MinV=i;
        }
    }
    return MinV;
}