prim求最小生成树

适用条件：稠密图

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=1005;
int g[N][N];
int dist[N];
int n,m;
bool st[N];
int pime(){
	memset(dist,0x3f,sizeof dist);
	int res=0;
	for(int i=0;i<n;i++){
		int t=-1;
		for(int j=1;j<=n;j++){
			if(!st[j]&&(t==-1||dist[j]<dist[t])){
				t=j;
			}
		}
		if(i&&dist[t]==0x3f3f3f3f)return dist[t];
		if(i)res+=dist[t];
		for(int j=1;j<=n;j++){
			dist[j]=min(dist[j],g[t][j]);
		}
		st[t]=true;
	}
	
	return res;
}
int main(){
	memset(g,0x3f,sizeof g);
	scanf("%d%d",&n,&m);
	while(m--){
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		g[a][b]=g[b][a]=min(g[a][b],c);
	}
	int t=pime();
	if(t==0x3f3f3f3f){
		printf("impossible");
	}else printf("%d",t);
	return 0;
}