这题是最小生成树的一题目,以前没写过最小生成树,所以在这道题的基础上学习一下最小生成树。
这道题中用的到时Prim算法,用的邻接矩阵,所以复杂度是O(V*V)
Prim算法的基本思想是:
1.清空生成树,任取一个顶点加入生成树
2.在那些一个端点在生成树里,另一个端点不在生成树里的边中,选取一条权最小的边,将它和另一个端点加进生成树
3.重复步骤2,直到所有的顶点都进入了生成树为止,此时的生成树就是最小生成树
int prime(int cur)
{
int index;
int sum = 0;
memset(visit, false, sizeof(visit));
visit[cur] = true;
for(int i = 0; i < m; i ++){
dist[i] = graph[cur][i];
}
for(int i = 1; i < m; i ++){
int mincost = INF;
for(int j = 0; j < m; j ++){
if(!visit[j] && dist[j] < mincost){
mincost = dist[j];
index = j;
}
}
visit[index] = true;
sum += mincost;
for(int j = 0; j < m; j ++){
if(!visit[j] && dist[j] > graph[index][j]){
dist[j] = graph[index][j];
}
}
}
return sum;
}
所以这道题的代码就是如下:
# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# define INF 10000000
int N;
int graph[105][105];
int visit[105],dis[105];
int work()
{
int i,j,mincost,index,sum = 0;
for(i = 1;i <= N;i ++)
dis[i] = graph[1][i];
visit[1] = 1;
for(i = 1;i < N;i ++)
{
mincost = INF;
for(j = 1;j <= N;j ++)
{
if(!visit[j] && dis[j] < mincost)
{
mincost = dis[j];
index = j;
}
}
visit[index] = 1;
sum += mincost;
for(j = 1;j <= N;j ++)
{
if(!visit[j] &&dis[j] > graph[index][j])
dis[j] = graph[index][j];
}
}
return sum;
}
void Init()
{
int i,j;
memset(visit,0,sizeof(visit));
for(i = 1;i <= N;i ++)
for(j = 1;j <= N;j ++)
graph[i][j] = graph[j][i] = INF;
for(i = 1;i <= N;i ++)
graph[i][i] = 0;
}
int main()
{
int i,a,b,c;
while(~scanf("%d",&N)&&N)
{
Init();
for(i = 0;i < N*(N-1)/2;i ++)
{
scanf("%d%d%d",&a,&b,&c);
graph[a][b] = graph[b][a] = c;
}
printf("%d\n",work());
}
return 0;
}