Slim Span 求生成树的最大边与最小边的差最小的值

Slim Span

Time Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  POJ 3522

Description

Given an undirected weighted graph G, you should find one of spanning trees specified as follows.

The graph G is an ordered pair (V, E), where V is a set of vertices {v₁, v₂, …, v_n} and E is a set of undirected edges {e₁, e₂, …, e_m}. Each edge e ∈ E has its weight w(e).

A spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices with n − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among the n − 1 edges of T.

 
Figure 5: A graph  G and the weights of the edges

For example, a graph G in Figure 5(a) has four vertices {v₁, v₂, v₃, v₄} and five undirected edges {e₁, e₂, e₃, e₄, e₅}. The weights of the edges are w(e₁) = 3, w(e₂) = 5, w(e₃) = 6, w(e₄) = 6, w(e₅) = 7 as shown in Figure 5(b).

 
Figure 6: Examples of the spanning trees of  G

There are several spanning trees for G. Four of them are depicted in Figure 6(a)~(d). The spanning tree T_a in Figure 6(a) has three edges whose weights are 3, 6 and 7. The largest weight is 7 and the smallest weight is 3 so that the slimness of the tree T_a is 4. The slimnesses of spanning trees T_b, T_c and T_d shown in Figure 6(b), (c) and (d) are 3, 2 and 1, respectively. You can easily see the slimness of any other spanning tree is greater than or equal to 1, thus the spanning tree Td in Figure 6(d) is one of the slimmest spanning trees whose slimness is 1.

Your job is to write a program that computes the smallest slimness.

Input

The input consists of multiple datasets, followed by a line containing two zeros separated by a space. Each dataset has the following format.

n	m
a1	b1	w1
	⋮
am	bm	wm

Every input item in a dataset is a non-negative integer. Items in a line are separated by a space. n is the number of the vertices and m the number of the edges. You can assume 2 ≤ n ≤ 100 and 0 ≤ m ≤ n(n − 1)/2. a_k and b_k (k = 1, …, m) are positive integers less than or equal to n, which represent the two vertices v_ak and v_bk connected by the kth edge e_k. w_k is a positive integer less than or equal to 10000, which indicates the weight of e_k. You can assume that the graph G = (V, E) is simple, that is, there are no self-loops (that connect the same vertex) nor parallel edges (that are two or more edges whose both ends are the same two vertices).

Output

For each dataset, if the graph has spanning trees, the smallest slimness among them should be printed. Otherwise, −1 should be printed. An output should not contain extra characters.

Sample Input

4 5
1 2 3
1 3 5
1 4 6
2 4 6
3 4 7
4 6
1 2 10
1 3 100
1 4 90
2 3 20
2 4 80
3 4 40
2 1
1 2 1
3 0
3 1
1 2 1
3 3
1 2 2
2 3 5
1 3 6
5 10
1 2 110
1 3 120
1 4 130
1 5 120
2 3 110
2 4 120
2 5 130
3 4 120
3 5 110
4 5 120
5 10
1 2 9384
1 3 887
1 4 2778
1 5 6916
2 3 7794
2 4 8336
2 5 5387
3 4 493
3 5 6650
4 5 1422
5 8
1 2 1
2 3 100
3 4 100
4 5 100
1 5 50
2 5 50
3 5 50
4 1 150
0 0

这个题真的是错误百出啊，明明不是很难的题，结果硬是让自己做出了各种错误，判断不能构成树判断错误，还想着是不是要去掉生成树的最大的边，还上另一条边再求一次，真是傻了，明明求的是最小值，你换上一条比上一条边还大的数有什么意义吗，不想相当于白求了，无奈啊，这个题不知道做了多长时间了

AC代码

#include<iostream>  
#include<cstdio>
#include<cstring>  
#include<string>      
#include<queue>      
#include<algorithm>       
#include<map>      
#include<queue>
#include<iomanip>       
#define inf 0x3f3f3f3f      
#define maxn 101
#define maxm 5050    
using namespace std;
int n,m,Min;
int f[maxn];
struct node {
	int x,y,w;
};
node edge[maxn*(maxn-1)/2];
int cmp(node a, node b)
{
	return a.w<b.w;
}
int getf(int i)
{
	if(i==f[i])
		return i;
	else {
		f[i]=getf(f[i]);
		return f[i];
	}
}

int merge(int a, int b) 
{
	int i=getf(a);
	int j=getf(b);
	if(i==j) return 0;
	else {
		f[j]=i;
		return 1;
	}
}

int main()
{
	while(~scanf("%d%d",&n,&m) && n) {
		Min=inf;
		for(int i=0;i<m;++i) {
			scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].w);
		}
		sort(edge,edge+m,cmp);
		/*if(m<n-1) {
			printf("-1\n");
			continue;
		}*/ //真是错误百出啊，不能构成一棵树怎么能这样求，无语 
 		
		int i,j,temp;
   		for(i=0;i<m;++i) { 
			int cnt=0; 
			for(j=1;j<=n;++j)
				f[j]=j;
			for(j=i;j<m;++j) {
				if(merge(edge[j].x,edge[j].y)) {
					++cnt;
					if(cnt==n-1) {
						temp=edge[j].w-edge[i].w;
						if(Min>temp) Min=temp; //没有必要去掉最大边，换上另一条边，因为让求的是最小的值，所以只求每次的最小生成树 
						//f[edge[j].y]=edge[j].y;
						//f[edge[j].y]=getf(edge[j].y);//取消最后一条边的指向,让它重新指回自己的祖先 
						//--cnt; 
						break;
					}
				}
			}
		}
		if(Min!=inf) //这才是判断存不存在生成树的条件，m<n-1只是满足这种条件一定不能构成生成树，但不是充分必要
			printf("%d\n",Min); //条件啊 
		else printf("-1\n");
	}
	return 0;
}