51Nod 1212 无向图最小生成树

题目链接

跟看长度排序，如果两个的father是同一个continue  否则添加

#include<iostream>#include<cstdio>#include<math.h>#include<cstring>#include<algorithm>#include<queue>#include<set>#include<vector>using namespace std;typedef struct node{int x,y,len;}node;node no[50001];int father[1001];bool cmp(node n1,node n2){return n1.len<n2.len;}int find(int x){if(x==father[x]) return x;return father[x]=find(father[x]); }int main(){int n,m;cin>>n>>m;for(int i=0;i<m;i++){cin>>no[i].x>>no[i].y>>no[i].len;} for(int i=0;i<1001;i++) father[i]=i;sort(no,no+m,cmp);int sum=0;for(int i=0;i<m;i++){int a=find(no[i].x),b=find(no[i].y);if(a!=b){father[a]=b;sum+=no[i].len;}}cout<<sum;return 0;}