POJ - 3522 Slim Span (kruskal+枚举)

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 weightw(e).

A spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices withn − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among then − 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 arew(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 treeT_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 treeT_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.

nm a₁b₁w₁ ⋮ a_mb_mw_m

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 andb_k (k = 1, …, m) are positive integers less than or equal ton, which represent the two vertices v_ak andv_bk connected by the kth edge e_k.w_k is a positive integer less than or equal to 10000, which indicates the weight ofe_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 51 2 31 3 51 4 62 4 63 4 74 61 2 101 3 1001 4 902 3 202 4 803 4 402 11 2 13 03 11 2 13 31 2 22 3 51 3 65 101 2 1101 3 1201 4 1301 5 1202 3 1102 4 1202 5 1303 4 1203 5 1104 5 1205 101 2 93841 3 8871 4 27781 5 69162 3 77942 4 83362 5 53873 4 4933 5 66504 5 14225 81 2 12 3 1003 4 1004 5 1001 5 502 5 503 5 504 1 1500 0

Sample Output

1200-1-110168650

题意：求最小生成树最大边和最小边的最小差值

思路：kruskal排序后每次第一个选的和最后一个选的就是差值，找到最小的

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;const int maxn = 110;const int inf = 0x3f3f3f3f;struct Edge {int from, to, dist;} edge[maxn*maxn];int n, m;int ans, fa[maxn];int cmp(Edge a, Edge b) {return a.dist < b.dist;}void init() {for (int i = 1; i <= n; i++)fa[i] = i;}int find(int x) {if (x != fa[x])fa[x] = find(fa[x]);return fa[x];}void kruskal() {ans = inf;sort(edge, edge+m, cmp);for (int i = 0; i < m; i++) {init();int cnt = 0, tmp = inf;for (int j = i; j < m; j++) {int fx = find(edge[j].from);int fy = find(edge[j].to);if (fx != fy) {fa[fx] = fy;cnt++;if (cnt == n-1) {tmp = edge[j].dist - edge[i].dist;break;}}}if (tmp < ans)ans = tmp;}}int main() {while (scanf("%d%d", &n, &m) != EOF && n+m) {for (int i = 0; i < m; i++)scanf("%d%d%d", &edge[i].from, &edge[i].to, &edge[i].dist);kruskal();if (ans == inf) printf("-1\n");else printf("%d\n", ans);}return 0;}