题意:求最小生成树中的最长边
思路:最小瓶颈树(MBT)。MBT推不出MST,但是MST一定是MBT,所以求一棵最小生成树即可。kruskal算法,最后加入的边即为所求。
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define N 2005
#define M 10005
int father[N];
struct edge{
int x,y,w;
}e[M];
int n,m;
int cmp(const struct edge* a,const struct edge* b){
return (*a).w-(*b).w;
}
int find(x){
if(father[x] == x)
return x;
else return father[x] = find(father[x]);
}
int kruskal(){
int i,j;
for(i = 1,j=0;i<n;j++){
int x = find(e[j].x);
int y = find(e[j].y);
if(x!=y){
father[x] = y;
i++;
if(i == n)
return e[j].w;
}
}
return -1;
}
int main(){
freopen("a.txt","r",stdin);
while(scanf("%d %d",&n,&m)!=EOF){
int i;
for(i = 1;i<=n;i++)
father[i] = i;
for(i = 0;i<m;i++)
scanf("%d %d %d",&e[i].x,&e[i].y,&e[i].w);
qsort(e,m,sizeof(struct edge),cmp);
printf("%d\n",kruskal());
}
return 0;
}