Description
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Input
The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.
Output
For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.
Sample Input
4 0 4 9 21 4 0 8 17 9 8 0 16 21 17 16 0
Sample Output
28赤裸裸的Prim算法。代码如下:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int INF = 0x7fffffff;
const int MAXV = 500;
int cost[MAXV][MAXV];//各个边的权值
bool used[MAXV];//顶点是否在集合中
int mincost[MAXV];//其余顶点距集合中元素的边最小值
int V;//顶点数
int prim()
{
for (int i = 0; i < V; i++)
{
used[i] = false;
mincost[i] = INF;
}
int res = 0;
mincost[0] = 0;
while (true)
{
int v = -1;//寻找下一个加入集合的顶点v
for (int i = 0; i < V; i++)
{
if (!used[i] && (v == -1 || mincost[i] < mincost[v]))
{
v = i;
}
}
if (v == -1)
break;//所有顶点均在集合中
used[v] = true;
res += mincost[v];
for (int i = 0; i < V; i++)//更新其他所有与结点v相连的所有结点
{
mincost[i] = min(mincost[i], cost[v][i]);
}
}
return res;
}
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("D:\\in.txt", "r", stdin);
freopen("D:\\out.txt", "w", stdout);
#endif
while (cin >> V)
{
for (int i = 0; i < V; i++)
for (int j = 0; j < V; j++)
cin >> cost[i][j];
int d = prim();
cout << d << endl;
}
return 0;
}