UVA796 - Critical Links(Tarjan求桥)
2016-05-16 21:04
381 查看
In a computer network a link L, which interconnects two servers, is considered critical if there are at
least two servers A and B such that all network interconnection paths between A and B pass through L.
Removing a critical link generates two disjoint sub–networks such that any two servers of a sub–network
are interconnected. For example, the network shown in figure 1 has three critical links that are marked
bold: 0 -1, 3 - 4 and 6 - 7.
Figure 1: Critical links
It is known that:
1. the connection links are bi–directional;
2. a server is not directly connected to itself;
3. two servers are interconnected if they are directly connected or if they are interconnected with
the same server;
4. the network can have stand–alone sub–networks.
Write a program that finds all critical links of a given computer network.
Input
The program reads sets of data from a text file. Each data set specifies the structure of a network and
has the format:
no of servers
server0 (no of direct connections) connected server . . . connected server
. . .
serverno of servers (no of direct connections) connected server . . . connected server
The first line contains a positive integer no of servers(possibly 0) which is the number of network
servers. The next no of servers lines, one for each server in the network, are randomly ordered and
show the way servers are connected. The line corresponding to serverk, 0 ≤ k ≤ no of servers − 1,
specifies the number of direct connections of serverk and the servers which are directly connected to
serverk. Servers are represented by integers from 0 to no of servers − 1. Input data are correct. The
first data set from sample input below corresponds to the network in figure 1, while the second data
set specifies an empty network.
Output
The result of the program is on standard output. For each data set the program prints the number of
critical links and the critical links, one link per line, starting from the beginning of the line, as shown
in the sample output below. The links are listed in ascending order according to their first element.
The output for the data set is followed by an empty line.
Sample Input
8
0 (1) 1
1 (3) 2 0 3
2 (2) 1 3
3 (3) 1 2 4
4 (1) 3
7 (1) 6
6 (1) 7
5 (0)
0
Sample Output
3 critical links
0 - 1
3 - 4
6 - 7
0 critical links
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=737
给你一个图,让你求这个图中哪些是桥,并输出;
View Code
least two servers A and B such that all network interconnection paths between A and B pass through L.
Removing a critical link generates two disjoint sub–networks such that any two servers of a sub–network
are interconnected. For example, the network shown in figure 1 has three critical links that are marked
bold: 0 -1, 3 - 4 and 6 - 7.
Figure 1: Critical links
It is known that:
1. the connection links are bi–directional;
2. a server is not directly connected to itself;
3. two servers are interconnected if they are directly connected or if they are interconnected with
the same server;
4. the network can have stand–alone sub–networks.
Write a program that finds all critical links of a given computer network.
Input
The program reads sets of data from a text file. Each data set specifies the structure of a network and
has the format:
no of servers
server0 (no of direct connections) connected server . . . connected server
. . .
serverno of servers (no of direct connections) connected server . . . connected server
The first line contains a positive integer no of servers(possibly 0) which is the number of network
servers. The next no of servers lines, one for each server in the network, are randomly ordered and
show the way servers are connected. The line corresponding to serverk, 0 ≤ k ≤ no of servers − 1,
specifies the number of direct connections of serverk and the servers which are directly connected to
serverk. Servers are represented by integers from 0 to no of servers − 1. Input data are correct. The
first data set from sample input below corresponds to the network in figure 1, while the second data
set specifies an empty network.
Output
The result of the program is on standard output. For each data set the program prints the number of
critical links and the critical links, one link per line, starting from the beginning of the line, as shown
in the sample output below. The links are listed in ascending order according to their first element.
The output for the data set is followed by an empty line.
Sample Input
8
0 (1) 1
1 (3) 2 0 3
2 (2) 1 3
3 (3) 1 2 4
4 (1) 3
7 (1) 6
6 (1) 7
5 (0)
0
Sample Output
3 critical links
0 - 1
3 - 4
6 - 7
0 critical links
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=737
给你一个图,让你求这个图中哪些是桥,并输出;
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <stack> #include <map> #include <vector> using namespace std; typedef long long LL; #define N 10005 #define met(a, b) memset(a, b, sizeof(a)) int dfn , low , Time; int n, f ; vector<vector<int> >G; struct node { int x, y; bool friend operator < (node A,node B) { if(A.x == B.x) return A.y < B.y; return A.x < B.x; } }a ; void Init() { met(dfn, 0); met(low, 0); met(f, 0); met(a, 0); G.clear(); G.resize(n+3); Time = 0; } void Tarjan(int u, int fa) { low[u] = dfn[u] = ++Time; f[u] = fa; int len = G[u].size(), v; for(int i=0; i<len; i++) { v = G[u][i]; if(!dfn[v]) { Tarjan(v, u); low[u] = min(low[u], low[v]); } else if(fa != v) low[u] = min(dfn[v], low[u]); } } int main() { while(scanf("%d", &n) != EOF) { Init(); int u, v, m; for(int i=0; i<n; i++) { scanf("%d (%d)", &u, &m); for(int j=0; j<m; j++) { scanf("%d", &v); G[u].push_back(v); G[v].push_back(u); } } for(int i=0; i<n; i++) if(!dfn[i]) Tarjan(i, -1); int ans = 0; for(int i=0; i<n; i++) { v = f[i]; if(v!=-1 && low[i]>dfn[v]) { a[ans].x = i; a[ans].y = v; if(a[ans].x>a[ans].y)swap(a[ans].x, a[ans].y); ans++; } } sort(a, a+ans); printf("%d critical links\n", ans); for(int i=0; i<ans; i++) printf("%d - %d\n", a[i].x, a[i].y); printf("\n"); } return 0; }
View Code
相关文章推荐
- Mybatis 框架使用的最核心内容(一):Mybatis的特点和映射管理
- 图片的LruCache缓存和DiskLruCache缓存
- 欢迎使用CSDN-markdown编辑器
- Intent
- Unity编辑器扩展之EditorWindow
- PL/SQL学习笔记
- APP开发实战23-通信过程
- Java--弹弹球(定时器与图形动画设计)
- 实用知识:音效播放的方法使用
- Android沉浸式通知栏
- 在unity中实现截图功能
- 数据同步:搜索引擎实时化
- oc 元类 元数据
- eclipse导入Django项目的一种方法
- Tomact 优化(转)
- Android 基于google Zxing实现对手机中的二维码进行扫描
- IOS 应用悬浮窗
- 57-005-1 bootstrap在表单中的利用,表单验证以及jquery验证框架的使用
- APP开发实战22-Socket连接
- 查找算法总结