#include<bits/stdc++.h>
using namespace std;
struct Edge{
int s,e;
int v;
}edge[3005];
bool cmp(Edge a,Edge b){
return a.v<b.v;
}
int pa[1005];
int findp(int a){
if(pa[a]!=a){
return findp(pa[a]);
}else
return a;
}
int join(int a,int b){
int f=0;
int faa,fab;
faa = findp(a);
fab = findp(b);
if(faa!=fab){
pa[fab]=faa;
f=1;
}
return f;
}
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>edge[i].s>>edge[i].e>>edge[i].v;
}
sort(edge,edge+m,cmp);
for(int i=1;i<=n;i++){
pa[i]=i;
}
int cnt=0;
int sum=0;
for(int i=0;i<m;i++){
if(join(edge[i].s,edge[i].e)==1){
cnt++;
sum+=edge[i].v;
}
}
if(cnt!=n-1)
cout<<"-1\n";
else
cout<<sum<<endl;
return 0;
}
最小生成树
最新推荐文章于 2024-10-06 21:18:37 发布