POJ 3522 - Slim Span - [kruskal求MST]

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.

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

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

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.

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 102
#define M 5000
#define INF 2147483647
int n,m;
struct Edge{
int u,v,w;
}e[M];
bool cmp(Edge a,Edge b){return a.w<b.w;}
int par[N];
int find(int x){return( par[x]==x ? x : par[x]=find(par[x]) );}
int kruskal(int st)//获得最小边，作为开始边
{
int i,cnt=;
for (i=;i<=n;i++) par[i]=i;//初始化并查集
for (i=st;i<m;i++)//遍历后面的每条边
{
int x=find(e[i].u),y=find(e[i].v);
if (x != y){//如果这条边的连接的左右节点还未连通
par[y]=x;//将这条边连通
if (++cnt==n-) break;//边计数增加1，如果边数到达了n-1条，那么一棵生成树已完成，跳出
}
}
if (cnt<n-) return -; //如果从开始边往后遍历，遍历完了所有边，依然无法产生一颗生成树，那么返回-1
return e[i].w-e[st].w; //否则就返回这棵生成树的“最大边权值 减去 最小边权值”的值
}
int main()
{
while (scanf("%d%d",&n,&m) && n!=)
{
for (int i=;i<m;i++) scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w);
sort(e,e+m,cmp);//把边按权值按从小到大排序
int tmp,ans=INF;
for (int i=;i<m;i++)//枚举最小边
{
tmp=kruskal(i);
if(tmp==-) break;//如果从这条最小边开始已经无法产生生成树了，之后显然也不会有生成树了，那么我们就直接跳出即可
if(tmp<ans) ans=tmp;//记录下最小的那个“最大边权值 减去 最小边权值”
}
if(ans==INF) printf("-1\n"); //如果答案没被更新过，那么显然连一棵生成树都没有，按题目要求打印-1
else printf("%d\n",ans);//否则就打印出答案即可
}
return ;
}