朴素Prim算法求最小生成树模板

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
const int N=5e2+10;
int n,m;
int edge[N][N],dist[N];
bool st[N];
int prim()
{
    int res=0;
    memset(dist,0x3f,sizeof(dist));
    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]==INF)return INF;
        st[t]=true;
        if(i)res+=dist[t];//这一行写在更新边权之前，防止数据出现自环
        for(int j=1;j<=n;j++)dist[j]=min(dist[j],edge[t][j]);
    }
    return res;
}

int main()
{
    cin>>n>>m;
    memset(edge,0x3f,sizeof(edge));
    while(m--)
    {
        int a,b,c;
        cin>>a>>b>>c;
        edge[a][b]=edge[b][a]=min(edge[a][b],c);
    }
    auto t=prim();
    if(t==INF)cout<<"impossible"<<endl;
    else cout<<t<<endl;
    return 0;
}