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
Output
Sample Input
4 0 4 9 21 4 0 8 17 9 8 0 16 21 17 16 0
Sample Output
28
用了prim算法 <我认为一般的prim算法里面含有三个数组,1 储存输入数据的二维数组 2 是否加入集合的数组bj[] 3 储存最短边的数组> 详情看代码注释
/***
prim算法
*/
#include<stdio.h>
#include<string.h>
int mp[150][150],low[150],bj[150],n;
#define INF 99999999
int prim()
{
int i,j,k,sum,time;
for(i=1;i<=n;i++)
{
low[i]=mp[1][i];///先为当前最短边初始化
}
bj[1]=1;
sum=0;
time=1;
while(time<=n-1)///因为每循环一次找出一个点,所以只要循环n-1次一定能够把最小生成树找出来
{
int min1=INF;
for(i=1; i<=n; i++)///找两个点之间的最短距离
{
if(low[i]<min1&&bj[i]==0)///注意&&后面的条件
{
min1=low[i];
j=i;
}
}
sum+=min1;
bj[j]=1;///把找到的那个点加入到点集中<表示点j加入了构成最短路点的集合中>
for(i=1;i<=n;i++)
{
if(low[i]>mp[j][i] && bj[i]==0)///更新最短边
{
low[i]=mp[j][i];
}
}
time++;
}
return sum;
}
int main()
{
int i,j,k;
while(~scanf("%d",&n))
{
memset(mp,0,sizeof(mp));
memset(bj,0,sizeof(bj));///判断是否加入集合<这个集合指的是构造最短路的点做构成的集合>
memset(low,0,sizeof(low));///LOW数组存当前以点i为一个端点的边的最小值
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&mp[i][j]);
}
}
k=prim();
printf("%d\n",k);
}
return 0;
}