poj 3522 Slim Span(枚举+最小生成树)
来源:互联网 发布:网络攻防技术pdf 编辑:程序博客网 时间:2024/05/01 10:40
链接:
http://poj.org/problem?id=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 {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.
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 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
Source
#include<cstdio>#include<algorithm>using namespace std;const int VN = 110;// 点的数量const int EN = VN*VN; // 边的数量const int INF = 10000000; template<typename Type>class Kruskal{public: // n为点的数量 void init(int _n){ n=_n; size = 0; make_set(n); MSTsum = 0; } void insert(int u, int v, Type w){ if(u==v)return; E[size++].set(u,v,w); } Type kruskal(){ sort(E, E+size); int minLen=INF; for(int i=0; i<size-n+2; ++i){ make_set(n); int tmp_min=E[i].w, cnt=0; for(int j=i; j<size; ++j){ if(Union(E[j].u, E[j].v)){ if(++cnt==n-1){ if(E[j].w-tmp_min<minLen) minLen=E[j].w-tmp_min; if(minLen==0) return 0; //如果是0,那么已经是最小的了 break; } } } } if(minLen==INF) return -1; return minLen; } private: struct Edge{ int u,v; Type w; void set(int a,int b,Type c){u=a; v=b; w=c; } friend bool operator<(const Edge&a,const Edge&b){ return a.w < b.w; } }E[EN]; int f[VN],rank[VN]; int n, size; // n为点的数量, m为边的数量 Type MSTsum; // 并查集的操作 void make_set(int n){ for(int i=0; i<=n; ++i) f[i]=i, rank[i]=0; } int find(int x){ int i,j=x; while(j!=f[j]) j=f[j]; while(x!=j){ i=f[x]; f[x]=j; x=i; } return j; } bool Union(int x, int y){ int a=find(x), b=find(y); if(a==b)return false; if(rank[a]>rank[b]) f[b]=a; else{ if(rank[a]==rank[b]) ++rank[b]; f[a] = b; } return true; }};Kruskal<int>G;int n, m;int main(){ int a,b,c; while(~scanf("%d%d",&n,&m)&&n+m){ G.init(n); for(int i=0; i<m; ++i){ scanf("%d%d%d",&a,&b,&c); G.insert(a,b,c); } printf("%d\n", G.kruskal()); } return 0;}
—— 生命的意义,在于赋予它意义。
原创 http://blog.csdn.net/shuangde800 , By D_Double (转载请标明)
- poj 3522 Slim Span(枚举+最小生成树)
- POJ 3522 Slim Span (最小生成树)
- POJ 3522 Slim Span (最小生成树)
- POJ 3522 Slim Span(最小生成树)
- POJ 3522 Slim Span (Kruskal +枚举 边权差最小的生成树)
- POJ 3522 Slim Span【枚举+克鲁斯卡尔求最小生成树】
- POJ-3522 Slim Span 最小生成树最小边权差
- Poj 3552 Slim Span 最小生成树
- uva 1395 - Slim Span poj 3522 Slim Span(最小生成树算法)
- poj 3522 Slim Span(最小生成树)kruskal算法
- uva 1359 poj 3522 Slim Span(最小生成树)
- POJ 3522 Slim Span(最小生成树-Kruskal)
- UVa1395 && POJ 3522 Slim Span [最小生成树]
- POJ 3522 Slim Span(最小差值生成树)
- poj 3522 Slim Span(最小生成树 Kruskal算法)
- 最小生成树kruskal POJ 3522 Slim Span
- 【UVALive】3887 Slim Span 枚举+最小生成树
- [枚举最小瓶颈生成树]UVa-1395 - Slim Span(kruskal)
- 对于2 000 000 000 以内判断是否是素数 筛选法+暴力
- ASP.NET存储过程分页
- iBatis解决sql注入问题的方法
- spring定时器
- Ubuntu 10.04 Server下编译libjingle-0.6.14
- poj 3522 Slim Span(枚举+最小生成树)
- QT发布程序中文乱码完全解决方案 Qt for Windows
- Apache Shiro 架构
- c#查询部署机器的Office应用程序的版本
- undefined reference to `clock_gettime' 链接错误问题解决
- 一个基于HTML与JavaScript的Wizard演示
- python http
- c基础学习 - 指针
- [Bluetooth]蓝牙协议栈构架