POJ3522 UVA1395 UVALive3887 Slim Span【Kruskal算法+并查集+枚举】

Slim Span

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 9425		Accepted: 5014

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 {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.

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. 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).

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

Sample Output

1
20
0
-1
-1
1
0
1686
50

Source

Japan 2007

 

Regionals 2007 >> Asia - Tokyo

 

问题链接：POJ3522 UVA1395 UVALive3887 Slim Span

问题描述：（略）

问题分析：

  这是一个最小生成树的为问题，解决的算法有Kruskal（克鲁斯卡尔）算法和Prim（普里姆） 算法。

  这个题要算的是，最小生成树中的边权的最值之差的最小值。

  这样的话，就需要枚举一下各种最小生成树，再求得边权之差，最后求一下最小值即可。

程序说明：

  本程序使用Kruskal算法实现。有关最小生成树的问题,使用克鲁斯卡尔算法更具有优势，只需要对所有的边进行排序后处理一遍即可。程序中使用了并查集，用来判定加入一条边后会不会产生循环。程序中，图采用边列表的方式存储，排序一下就好了。

  程序中的代码都是套路。

AC的C++语言程序如下：

/* POJ3522 UVA1395 UVALive3887 Slim Span */

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <limits.h>

using namespace std;

const int N = 100;

int n, m;
int f[N + 1];

void UFInit(int n)
{
    for(int i = 1; i <=n; i++)
        f[i] = i;
}

int Find(int a) {
    return a == f[a] ? a : f[a] = Find(f[a]);
}

bool Union(int a, int b)
{
    a = Find(a);
    b = Find(b);
    if (a != b) {
        f[a] = b;
        return true;
    } else
        return false;
}

struct Edge {
    int u, v, w;
} e[N * (N - 1)];

bool cmp(Edge a, Edge b)
{
    return a.w < b.w;
}

int kruskal(int start)
{
    UFInit(n);

    int minw = INT_MAX, maxw = INT_MIN, cnt = 0;
    for(int i = start; i < m; i++) {
        if(Union(e[i].u, e[i].v)) {
            minw = min(minw, e[i].w);
            maxw = max(maxw, e[i].w);
            if(++cnt == n - 1)
                return maxw - minw;
        }
    }

    return -1;
}

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);

        // Kruscal算法
       int ans = INT_MAX;
       sort(e, e + m, cmp);
       for(int i = 0; i < m; i++) {
           int t = kruskal(i);
           if(t >= 0)
               ans = min(ans, t);
       }

       printf("%d\n", (ans == INT_MAX) ? -1 : ans);
    }

    return 0;
}