(1)朴素prim算法适合稠密图(复杂度:n^2)
#include<bits/stdc++.h>
using namespace std;
const int N=510;
int g[N][N],dist[N];
bool st[N];
int n,m;
int prim()
{
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[t]>dist[j]))
t=j;
}
if(i&&dist[t]==0x3f3f3f3f)return 0x3f3f3f3f;
st[t]=true;
if(i)res+=dist[t];
for(int j=1;j<=n;j++)dist[j]=min(dist[j],g[t][j]);
}
return res;
}
int main()
{
cin>>n>>m;
memset(g,0x3f,sizeof g);
memset(dist,0x3f,sizeof dist);
while(m--)
{
int a,b,c;
cin>>a>>b>>c;
g[a][b]=g[b][a]=min(g[a][b],c);
}
int t=prim();
if(t==0x3f3f3f3f)cout<<"impossible"<<endl;
else cout<<t<<endl;
}
(2)堆优化版用小根堆+邻接表,适合稀疏图(复杂度:mlogm)(m为边数)
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
const int N=510,M=1e5+10;
int h[N],e[2*M],ne[2*M],w[2*M],idx;
int dist[N],n,m;
bool st[N];
void add(int a,int b,int c)
{
e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}
int prim()
{
int cnt=0,res=0;
priority_queue<pii,vector<pii>,greater<pii>>q;
q.push({0,1});
while(q.size())
{
auto t=q.top();q.pop();
int ver=t.second,distance=t.first;
if(st[ver])continue;
st[ver]=true;
cnt++;
res+=distance;
for(int i=h[ver];~i;i=ne[i])
{
int j=e[i];
if(!st[j]&&w[i]<dist[j])
{
dist[j]=w[i];
q.push({w[i],j});
}
}
}
if(cnt!=n)return 0x3f3f3f3f;
return res;
}
int main()
{
cin>>n>>m;
memset(h,-1,sizeof h);
memset(dist,0x3f,sizeof dist);
while(m--)
{
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
add(b,a,c);
}
int ans=prim();
if(ans==0x3f3f3f3f)cout<<"impossible"<<endl;
else cout<<ans<<endl;
}