09-最小生成树 公路村村通

现有村落间道路的统计数据表中，列出了有可能建设成标准公路的若干条道路的成本，求使每个村落都有公路连通所需要的最低成本。

输入格式:

输入数据包括城镇数目正整数N（≤1000）和候选道路数目M（≤3N）；随后的M行对应M条道路，每行给出3个正整数，分别是该条道路直接连通的两个城镇的编号以及该道路改建的预算成本。为简单起见，城镇从1到N编号。

输出格式:

输出村村通需要的最低成本。如果输入数据不足以保证畅通，则输出−1，表示需要建设更多公路。

输入样例:

6 15
1 2 5
1 3 3
1 4 7
1 5 4
1 6 2
2 3 4
2 4 6
2 5 2
2 6 6
3 4 6
3 5 1
3 6 1
4 5 10
4 6 8
5 6 3

输出样例:

12

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

#include<iostream>
#include<cstdlib>
#define P 1005
#define inf 9999999
using namespace std;

typedef struct ENode * PtrToENode;
struct ENode{
    int V1,V2;
    int Weight;
};
typedef PtrToENode Edge;

typedef struct AdjVNode * PtrToAdjVNode;
struct AdjVNode{
    int Adjv;//邻接点下标
    int Weight;//边权重
    PtrToAdjVNode Next;
};

typedef struct Vnode{
    PtrToAdjVNode FirstEdge;
    int Data;
}AdjList[P];

typedef struct Gnode * PtrToGnode;
struct Gnode{
    int Nv;
    int Ne;
    AdjList G;
};
typedef PtrToGnode LGraph;

struct Graph{
    int Nv;//顶点数
    int Ne;//边数
    int G[P][P];//邻接矩阵
};

void InsertEdge(LGraph Graph,Edge E)
{
    PtrToAdjVNode NewNode;
    //插入边<V1,V2>
    //为V2建立新的结点
    NewNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
    NewNode->Adjv = E->V2;
    NewNode->Weight = E->Weight;
    //将V2插入V1的表头
    NewNode->Next = Graph->G[E->V1].FirstEdge;
    Graph->G[E->V1].FirstEdge = NewNode;
    
    //为V1建立新的结点
    NewNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
    NewNode->Adjv = E->V1;
    NewNode->Weight = E->Weight;
    //将V1插入V2的表头
    NewNode->Next = Graph->G[E->V2].FirstEdge;
    Graph->G[E->V2].FirstEdge = NewNode;
}

int FindMinDist(struct Graph *Graph,int dist[])
{
    int MinV,V;
    int MinDist = inf;
    
    for(V = 1; V <= Graph->Nv;V++)
    {
        if(dist[V] != 0 && dist[V] < MinDist)
        {
            MinDist = dist[V];
            MinV = V;
        }
    }
    
    if(MinDist < inf)
        return MinV;
    else
        return -1;
}

int main()
{
    struct Graph *Graph;
    Edge E;
    LGraph MST;
    Graph = (struct Graph *)malloc(sizeof(struct Graph));
    cin >> Graph->Nv >> Graph->Ne;
    int i,j,x,y,z;
    int V,W;
    int dist[P];//顶点i到Vt的最小权值
    int parent[P];
    int TotalWeight = 0;//权重和
    int VCount = 0;//收录的顶点数
    //初始化为无通路
    
    for(i = 1;i <= Graph->Nv;i++)
    {
        for(j = 1;j <= Graph->Nv;j++)
        {
            Graph->G[i][j] = inf;
        }
    }
    //赋值
    for(i = 1;i <= Graph->Ne;i++)
    {
        cin >> x >> y >> z;
        Graph->G[x][y] = Graph->G[y][x] = z;
    }
    
    for(V = 1; V <= Graph->Nv;V++)
    {
        dist[V] = Graph->G[1][V];
        parent[V] = 1;
    }
    
    MST = (LGraph)malloc(sizeof(struct Gnode));
    MST->Nv = Graph->Nv;
    MST->Ne = 1;
    for(int V = 1; V <= MST->Nv;V++)
    {
        MST->G[V].FirstEdge = NULL;
    }
    E = (Edge)malloc(sizeof(struct ENode));
    
    dist[1] = 0;
    VCount++;
    parent[1] = -1;
    
    while(1)
    {
        V = FindMinDist(Graph,dist);
        if(V == -1)
        {
            break;
        }
        E->V1 = parent[V];
        E->V2 = V;
        E->Weight = dist[V];
        InsertEdge(MST,E);
        TotalWeight += dist[V];
        dist[V] = 0;
        VCount++;
        
        for(W = 1;W <= Graph->Nv;W++)//对图中的每个顶点w
        {
            if(dist[W] != 0 && Graph->G[V][W] < inf)
            {
                if(Graph->G[V][W] < dist[W])
                {
                    dist[W] = Graph->G[V][W];
                    parent[W] = V;
                }
            }
        }
    }
    if(VCount < Graph->Nv)
        TotalWeight = -1;
    cout << TotalWeight << endl;
    
    return 0;
}