prim算法
void prim()
{
int min,k;
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
{
dis[i]=city[1][i];
}
dis[1]=0;
vis[1]=1;
for(int i=1;i<=n;i++)
{
min=INF;
for(int j=1;j<=n;j++)
{
if(!vis[j]&&min>dis[j])
{
k=j;
min=dis[j];
}
}
if(min==INF) break;
vis[k]=1;
ans+=dis[k];
for(int j=1;j<=n;j++)
{
if(!vis[j]&&dis[j]>city[k][j])
{
dis[j]=city[k][j];
}
}
}
}
int main()
{
ans=0;
prim();
cout<<ans<<endl;
}
kruskal算法
#define maxn 50010
#define INF 0x3f3f3f3f
int n,m;
int x,y,d;
int ans,cnt;
int f[maxn];
struct node{
int x;
int y;
int d;
}people[maxn];
int cmp(node a,node b)
{
return a.d<b.d;
}
void init()
{
for(int i=1;i<maxn;i++)
{
f[i]=i;
}
}
void add(int x,int y,int d)
{
people[cnt].x=x;
people[cnt].y=y;
people[cnt].d=d;
cnt++;
}
int find(int x)
{
if(x!=f[x]) f[x]=find(f[x]);
return f[x];
}
int kruskal()
{
sort(people,people+cnt,cmp);
for(int i=0;i<cnt;i++)
{
int fx=find(people[i].x);
int fy=find(people[i].y);
if(fx!=fy)
{
f[fy]=fx;
ans-=people[i].d;
}
}
}
int main()
{
cin>>n>>m;
while(m--)
{
cin>>x>>y>>d;
add(x,y,d);
}
ans=0;
kruskal();
cout<<ans<<endl;
}