水题,基本是裸的kruskal,不多说了。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXN 102
#define MAXM 102*101/2
#define INF 1<<30
//int first[MAXN];
struct edge { int u, v, w; }a[MAXM];
bool operator<(const edge& a, const edge& b) { return a.w<b.w; }
int n, m;
int pa[MAXN]; //pa[u] 是u的直接父亲,而不是 树根 !!!
void init_set() { for(int i=1; i<=n; i++) pa[i]=i; } //1-th 此题~
int find_pa(int x)
{
if(pa[x] != x) return pa[x] = find_pa(pa[x]); // pa[x] = find_pa(pa[x]) 压缩路径
else return x;
}
void Merge(int u, int v) { pa[find_pa(u)] = find_pa(v); }
int isMerge(int u, int v) { return find_pa(u) == find_pa(v); }
int kruskal(int minE)
{
init_set();
int cnt=0;
for(int i=minE; i<m; i++)
{
int u = a[i].u, v = a[i].v;
if(!isMerge(u, v))
{
cnt++;
Merge(u, v);
if(cnt == n-1)
{
return a[i].w-a[minE].w;
}
}
}
return -1;
}
int read_graph()
{
if(cin>>n>>m && n!=0)
{
for(int i=0; i<m; i++)
cin>>a[i].u>>a[i].v>>a[i].w;
return 1;
}
return 0;
}
int main()
{
while(read_graph())
{
sort(a, a+m);
int ans;
if((ans = kruskal(0)) == -1) { cout<<-1<<endl; continue; }
for(int i=1; i<m; i++)
{
int t = kruskal( i );
if(t != -1)
ans = ans<t? ans: t;
}
cout<<ans<<endl;
}
}