poj3522最小生成树
来源:互联网 发布:手机编程序软件 编辑:程序博客网 时间:2024/04/27 03:26
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} andE is a set of undirected edges {e1,e2, …, em}. Each edgee ∈ E has its weight w(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 {v1,v2, v3,v4} and five undirected edges {e1,e2, e3,e4, e5}. The weights of the edges arew(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 treeTa 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 treeTa is 4. The slimnesses of spanning treesTb, Tc andTd 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 andbk (k = 1, …, m) are positive integers less than or equal to n, which represent the two verticesvak andvbk connected by thekth edge ek. wk is a positive integer less than or equal to 10000, which indicates the weight ofek. You can assume that the graphG = (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
1200-1-110168650
题意是求所有的生成树中最长的边和最小边的最小差距。把所有的树都遍历一遍然后在找最小的差距。
#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#define inf 0x3f3f3fusing namespace std;struct node{ int x,y,z;} no[10005];int f[105];int fin(int x){ if(x!=f[x]) return f[x]=fin(f[x]); else return x;}int w(int x,int y){ int p=fin(x); int q=fin(y); if(p!=q) { f[p]=q; return 1; } else return 0;}void in(){ for(int i=0; i<105; i++) f[i]=i;}bool cmp(node m,node n){ return m.z<n.z;}int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { if(m==0&&n==0) break; memset(no,0,sizeof(no)); for(int i=0; i<m; i++) { scanf("%d%d%d",&no[i].x,&no[i].y,&no[i].z); } sort(no,no+m,cmp); in(); int l=0; int ans=inf; for(int i=0; i<m; i++) { int k=i; int flag=0; if(k>m-n+1) break; int cnt=0; int ma=-inf,mi=inf; for(int j=k; j<m; j++) { if(w(no[j].x,no[j].y)==1) { cnt++; ma=max(ma,no[j].z); mi=min(mi,no[j].z); } if(cnt==n-1) { flag=1; l=1; break; } } in(); if(flag==1) ans=min(ans,(ma-mi)); } if(l==0) printf("-1\n"); else printf("%d\n",ans); }}
- poj3522最小生成树
- POJ3522-类最小生成树
- POJ3522差值最小的生成树
- POJ3522 Slim Span(最小生成树,Kruakal)
- POJ3522—最小生成树的巧妙应用
- poj3522-kruscal算法求最小生成树+枚举
- POJ3522——Slim Span(最小生成树)
- poj3522(求最大边最小边差值最小的生成树)
- poj3522求一棵生成树使最大的边和最小的边差值最小
- POJ3522 SlimSpan 最大边和最小边的差最小的生成树
- poj3522 Slim Span 最长边与最短边差值最小的生成树,kruskal算法 + 暴力枚举
- POJ3522 Slim Span 解题报告【Kruskal求最小生成树+枚举】
- kru生成树变种 poj3522 bzoj 1196
- UVa1395&POJ3522--Slim Span【kruskal】瓶颈生成树
- poj3522
- 最小比例 最小生成树
- 最小生成树&&次最小生成树
- 最小生成生成树计数
- CSS3:如何保持浮层水平垂直居中
- 为什么 Android 要采用 Binder 作为 IPC 机制?
- Eclipse 编辑器中显示当前文件的路径(面包屑栏)
- Swift3.0 URLSession学习笔记
- Different Ways to Add Parentheses问题及解法
- poj3522最小生成树
- 设计模式大全(java,android)
- 提升测试用例专业性的八个步骤
- 一个程序媛的心声
- js数组filter map forEach every some以及jquery的each 操作
- Eclipse Neon 安装 findbugs
- 笔记—自定义View之Canvas对绘制的辅助
- 缓存二、HttpRuntime.Cache用法
- 从安装开始讲解的mysql主从复制