求一棵生成树,使它的最大边与最小边之差最小。
对所有边从小到大排序,然后顺序枚举每一条边并且以这条边为最小边求最小生成树(用kruskal比较方便)。每次求完最小生成树后判断是否能更新答案。
#include <iostream>
#include<stdio.h>
#include<algorithm>
#define INF 1000000000
#define maxn 100000
using namespace std;
int n,m;
typedef struct edge{
int u,v,w;
}Edge;
Edge e[maxn];
int ans;
int fa[maxn];
int min_e;//生成树最小边
int max_e;//生成树最大边
int cmp(const void *a,const void *b)
{
Edge* aa = (Edge*)a;
Edge* bb = (Edge*)b;
return aa->w - bb->w;
}
int find(int a)
{
return fa[a] == a?a:fa[a] = find(fa[a]);
}
void kruskal(int cur)
{
int cnt = 0;
min_e = INF;
max_e = 0;
int flag = 0; //是否能生成树
for(int i = cur;i < m;i++)
{
int u = e[i].u;
int v = e[i].v;
int w = e[i].w;
int fa_u = find(u);
int fa_v = find(v);
if(fa_u != fa_v)
{
fa[fa_u] = fa_v;
if(w < min_e) min_e = w;
if(w > max_e) max_e = w;
cnt++;
}
if(cnt == n - 1) {flag = 1;break;}
}
if(flag)
{
if(max_e - min_e < ans) ans = max_e - min_e;
}
}
int main()
{
while(scanf("%d %d",&n,&m),n+m)
{
for(int i = 0;i < m;i++)
{
scanf("%d %d %d",&e[i].u,&e[i].v,&e[i].w);
}
qsort(e,m,sizeof(Edge),cmp);
ans = INF;
for(int i = 0;i < m;i++)
{
for(int j = 1;j <= n;j++) fa[j] = j;
kruskal(i); //从第i条边开始找最小生成树
}
if(ans == INF) printf("-1\n");
else printf("%d\n",ans);
}
return 0;
}