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 {v1, v2, …, vn} and E is a set of undirected edges {e1, e2, …, em}. 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 {v1, v2, v3, v4} and five undirected edges {e1, e2, e3, e4, e5}. The weights of the edges are w(e1) = 3, w(e2) = 5, w(e3) = 6, w(e4) = 6, w(e5) = 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 Ta 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 Ta is 4. The slimnesses of spanning trees Tb, Tc and Td 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.
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. ak and bk (k = 1, …, m) are positive integers less than or equal to n, which represent the two vertices vak and vbk connected by the kth edge ek. wk is a positive integer less than or equal to 10000, which indicates the weight of ek. 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).
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.
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 0Sample Output
1 20 0 -1 -1 1 0 1686 50
题意： 寻找一颗生成树，输出最大边与最小边的差值，并且要保证这个差值是最小的。
思路分析 ： 首先，我们要知道一个最小生成树的性质，最小生成树的性质， 一个图的最小生成树不一定是唯一的，但是组成这些最小生成树的各个边的权值一定都是一一对应相同的。不会出现这种一个树上有两个边权值a+b等于另外一颗树上两个边c+d，然后这两个树都是最小生成树的情况
根据这个性质我们就可以去枚举最小边，每次求最小生成树，找差值最小的一种情况
代码示例 ：
const int maxn = 1e6+5;
const int inf = 0x3f3f3f3f;
#define ll long long
int n, m;
struct node
{
int x, y, w;
bool operator< (const node &v)const{
return w > v.w;
}
}arr[5005];
int f[505];
inline int fid(int x){
return x==f[x]?x:fid(f[x]);
}
int main() {
int a, b, w;
while(scanf("%d%d", &n, &m) && n+m){
if (m == 0) {printf("-1
"); continue;}
for(int i = 1; i <= m; i++){
in(a), in(b), in(w);
arr[i].x = a, arr[i].y = b, arr[i].w = w;
}
sort(arr+1, arr+1+m);
int p = 0;
int ans = inf;
while(1) {
p++;
for(int i = 1; i <= n; i++) f[i] = i;
int mm = arr[p].w;
int mi = arr[p].w;
for(int i = p; i <= m; i++){
int x1 = fid(arr[i].x), x2 = fid(arr[i].y);
if (x1 != x2){
f[x1] = x2;
mi = min(mi, arr[i].w);
}
}
int cnt = 0;
for(int i = 1; i <= n; i++){
if (i == f[i]) cnt++;
}
if (cnt != 1) break;
ans = min(ans, mm-mi);
}
if (ans == inf) printf("-1
");
else printf("%d
", ans);
}
return 0;
}