(求割点和除去割点后的联通块数目) poj 1523
2015-05-13 14:15
309 查看
SPF
Description
Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left would prevent some of the still available nodes from communicating with each other. Nodes 1 and 2 could still communicate with each other as could nodes 4 and 5, but communication between any other pairs of nodes would no longer be possible.
Node 3 is therefore a Single Point of Failure (SPF) for this network. Strictly, an SPF will be defined as any node that, if unavailable, would prevent at least one pair of available nodes from being able to communicate on what was previously a fully connected network. Note that the network on the right has no such node; there is no SPF in the network. At least two machines must fail before there are any pairs of available nodes which cannot communicate.
Input
The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.
Output
For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist.
The first network in the file should be identified as "Network #1", the second as "Network #2", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text "No SPF nodes" instead of a list of SPF nodes.
Sample Input
Sample Output
Source
Greater New York 2000
d数组代表这个点在多少个点双中
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 6766 | Accepted: 3086 |
Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left would prevent some of the still available nodes from communicating with each other. Nodes 1 and 2 could still communicate with each other as could nodes 4 and 5, but communication between any other pairs of nodes would no longer be possible.
Node 3 is therefore a Single Point of Failure (SPF) for this network. Strictly, an SPF will be defined as any node that, if unavailable, would prevent at least one pair of available nodes from being able to communicate on what was previously a fully connected network. Note that the network on the right has no such node; there is no SPF in the network. At least two machines must fail before there are any pairs of available nodes which cannot communicate.
Input
The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.
Output
For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist.
The first network in the file should be identified as "Network #1", the second as "Network #2", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text "No SPF nodes" instead of a list of SPF nodes.
Sample Input
1 2 5 4 3 1 3 2 3 4 3 5 0 1 2 2 3 3 4 4 5 5 1 0 1 2 2 3 3 4 4 6 6 3 2 5 5 1 0 0
Sample Output
Network #1 SPF node 3 leaves 2 subnets Network #2 No SPF nodes Network #3 SPF node 2 leaves 2 subnets SPF node 3 leaves 2 subnets
Source
Greater New York 2000
d数组代表这个点在多少个点双中
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<string> #include<algorithm> #include<cstdlib> #include<queue> #include<stack> #include<vector> #include<set> #include<map> using namespace std; stack<int> s; int use[1001],Dfs[1001],low[1001],mp[1001][1001],vis[1001],d[1001]; bool isstack[1001]; int top,newflag; void init() { memset(use,0,sizeof(use)); memset(low,0,sizeof(low)); memset(mp,0,sizeof(mp)); memset(Dfs,0,sizeof(Dfs)); memset(vis,0,sizeof(vis)); memset(d,0,sizeof(d)); top=newflag=0; while(!s.empty()) s.pop(); } void tarjan(int u,int father) { Dfs[u]=low[u]=++top; s.push(u); isstack[u]=1; for(int i=1;i<=1000;i++) { if(mp[u][i]&&i!=father) { int v=i; if(!Dfs[v]) { tarjan(v,u); low[u]=min(low[u],low[v]); if(low[v]>=Dfs[u]) { int x; s.push(u); do { x=s.top(); d[x]++; s.pop(); isstack[x]=0; }while(x!=v); } } else if(isstack[v]) low[u]=min(low[u],Dfs[v]); } } } int main() { int x,y,T=0; while(scanf("%d",&x),x) { init(); do { scanf("%d",&y); mp[x][y]=mp[y][x]=1; vis[x]=vis[y]=1; }while(scanf("%d",&x),x); printf("Network #%d\n",++T); for(int i=1;i<=1000;i++) { if(vis[i]&&!Dfs[i]) { tarjan(i,-1); } } bool flag=true; for(int i=1;i<=1000;i++) if(d[i]>=2) { printf(" SPF node %d leaves %d subnets\n",i,d[i]); flag=0; } if(flag) { printf(" No SPF nodes\n"); } printf("\n"); } return 0; }
相关文章推荐
- poj 1523 (统计割点,及割点所分割的块数)
- 【tarjan双连通求割点&连通分量】POJ 1523
- POJ 1523——Tarjan + 计算删除割点后的连通分支数
- POJ 1523 SPF 求割点的好(板子)题!
- POJ 1523 SPF【求割点及其BCC数目】
- POJ1523(求连用分量数目,tarjan算法原理理解)
- poj1523割点&&块
- POJ 1523--SPF【无向图的所有割点 && 删去该点后bcc的数目】
- poj 1523 求无向图所有割点以及删除割点后连通分量个数 给出详细算法思路
- poj1523赤裸裸的割点
- POJ 1523 无向图的割点
- poj1523割点模板
- poj1523 SPF 双连通求割点
- poj 1523 SPF 图论基础 图的割点
- POJ 1523 SPF tarjan求割点模板
- poj 1523(无向联通图的割点)
- poj 1523 求图的割点
- poj 1523 SPF 求割点以及删除该割点后联通块的数量
- poj 1523 SPF【点双连通求去掉割点后bcc个数】
- POJ1523 SPF (求割点——塔扬算法)