最小生成树prim n^2

最新推荐文章于 2020-07-15 10:53:46 发布

mislay丶

最新推荐文章于 2020-07-15 10:53:46 发布

阅读量278

点赞数

本文链接：https://blog.csdn.net/qq_39385774/article/details/77885978

版权

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

void prim();

const int N = 1010;
const int INF = 0x7f7f7f7f;

int g[N][N],n,m,ans = 0,minEdge[N];

int main(){
memset(g,0x7f,sizeof(g));
cin>>n>>m;
int x,y,w;
for(int i = 1;i <= m;i++){
cin>>x>>y>>w;
g[x][y] = g[y][x] = w;
}
prim();
return 0;
}

void prim(){
for(int i = 1;i <= n;i++){
minEdge[i] = g[1][i];
} // 任意选择一个点开始
minEdge[1] = 0;
int min,father;
for(int i = 1;i < n;i++){
min = INF;
for(int j = 1;j <= n;j++){
if(minEdge[j] != 0 && minEdge[j] < min){
min = minEdge[j];
father = j; // 找到离生成树最近的点加入，并且记录father
}
}
ans += min;
minEdge[father] = 0;
for(int j = 1;j <= n;j++){
if(minEdge[j] != 0 && minEdge[j] > g[father][j]){
minEdge[j] = g[father][j];
} //找一个边权最小的边
}
cout<<ans<<endl;
}
}
//O(n^2)适合稠密图