7-13 畅通工程之局部最小花费问题 (35分)
某地区经过对城镇交通状况的调查,得到现有城镇间快速道路的统计数据,并提出“畅通工程”的目标:使整个地区任何两个城镇间都可以实现快速交通(但不一定有直接的快速道路相连,只要互相间接通过快速路可达即可)。现得到城镇道路统计表,表中列出了任意两城镇间修建快速路的费用,以及该道路是否已经修通的状态。现请你编写程序,计算出全地区畅通需要的最低成本。
输入格式:
输入的第一行给出村庄数目N (1≤N≤100);随后的N(N−1)/2行对应村庄间道路的成本及修建状态:每行给出4个正整数,分别是两个村庄的编号(从1编号到N),此两村庄间道路的成本,以及修建状态
— 1表示已建,0表示未建。
输出格式:
输出全省畅通需要的最低成本。输入样例:
4
1 2 1 1
1 3 4 0
1 4 1 1
2 3 3 0
2 4 2 1
3 4 5 0输出样例:
3
#include <iostream>
#include <cstdlib>
using namespace std;
const int MVNUM = 1e2 + 5;
const int INF = 65535;
int vexnum, arcnum;
int mp[MVNUM][MVNUM];
int vis[MVNUM];
struct {
int adjvex;
int lowcost;
}closedge[MVNUM];
//code is ok
void Input()
{
cin >> vexnum;
arcnum = (vexnum - 1) * vexnum /2;
for (int i = 1; i <= vexnum; i++)
for (int j = 1; j <= vexnum; j++)
mp[i][j] = INF;
for (int i = 1; i <= arcnum; i++)
{
int v1, v2, cost, status;
cin >> v1 >> v2 >> cost >> status;
//已经建好的就不用花钱了,所以cost可以记0
if (status == 0)
{
mp[v1][v2] = cost;
mp[v2][v1] = cost;
}
if (status == 1)
{
mp[v1][v2] = 0;
mp[v2][v1] = 0;
}
}
}
int get_cur_nearest_vex()
{
int cur_vex = 0;
int dist = INF;
for (int i = 1; i <= vexnum; i++)
{
if (vis[i] == 0)
{
if (closedge[i].lowcost < dist)
{
cur_vex = i;
dist = closedge[i].lowcost;
}
}
}
return cur_vex;
}
void prime()
{
int cur_vex = 1;
int ans = 0;
for (int i = 1; i <= vexnum; i++)
{
if (i != cur_vex)
{
closedge[i].adjvex = cur_vex;
closedge[i].lowcost = mp[cur_vex][i];
}
}
vis[cur_vex] = 1;
for (int k = 1; k <= vexnum - 1; k++)
{
cur_vex = get_cur_nearest_vex();
vis[cur_vex] = 1;
for (int i = 1; i <= vexnum; i++)
{
if (vis[i] == 0 && mp[cur_vex][i] < closedge[i].lowcost)
{
closedge[i].adjvex = cur_vex;
closedge[i].lowcost = mp[cur_vex][i];
}
}
}
}
int main()
{
Input();
prime();
int res = 0;
for (int i = 2; i <= vexnum; i++)
res += closedge[i].lowcost;
cout << res << endl;
system("pause");
}