poj 1523 SPF(模板题)(Tarjan 关节点的朴素算法)
来源:互联网 发布:地理信息系统数据库 编辑:程序博客网 时间:2024/05/21 19:27
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7226 Accepted: 3298
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
1 25 43 13 23 43 501 22 33 44 55 101 22 33 44 66 32 55 100
Sample Output
Network #1 SPF node 3 leaves 2 subnetsNetwork #2 No SPF nodesNetwork #3 SPF node 2 leaves 2 subnets SPF node 3 leaves 2 subnets思路:
这是一个求无向图的关节点模板题,需要学会Tarjan算法。
代码:
//4160K16MS#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define min(a,b) ((a)>(b)?(b):(a))int edge[1001][1001];int vis[1001];//访问状态int nodes;//顶点数目int tmpdfn;//dfs时记录当前的深度优先搜索序号int dfn[1001];int low[1001];int son;//根节点的子女结点的个数int subnets[1001];//去除该点后的连通分量void dfs(int u){ for(int v=1;v<=nodes;v++) { if(edge[u][v]) { if(!vis[v]) { vis[v]=1; tmpdfn++;dfn[v]=low[v]=tmpdfn; dfs(v); low[u]=min(low[u],low[v]); if(low[v]>=dfn[u]) { if(u!=1)subnets[u]++; if(u==1)son++; } } else low[u]=min(low[u],dfn[v]); } }}void init(){ low[1]=dfn[1]=1; tmpdfn=1;son=0; memset(vis,0,sizeof(vis)); vis[1]=1; memset(subnets,0,sizeof(subnets));}int main(){ int u,v; int find;//是否寻找到关节点 int number=1;// while(1) { scanf("%d",&u); if(u==0) break; memset(edge,0,sizeof(edge)); nodes=0; scanf("%d",&v); if(v>nodes) nodes=v; if(u>nodes) nodes=u; edge[u][v]=edge[v][u]=1; while(1) { scanf("%d",&u); if(u==0) break; scanf("%d",&v); if(v>nodes) nodes=v; if(u>nodes) nodes=u; edge[u][v]=edge[v][u]=1; } if(number>1)cout<<endl; printf("Network #%d\n",number); number++; init(); dfs(1); if(son>1)subnets[1]=son-1; find=0; for(int i=1;i<=nodes;i++) { if(subnets[i]) { find=1; printf(" SPF node %d leaves %d subnets\n",i,subnets[i]+1); } } if(!find) printf(" No SPF nodes\n"); } return 0;}
0 0
- poj 1523 SPF(模板题)(Tarjan 关节点的朴素算法)
- poj 1144 Network(模板题)(Tarjan 关节点的朴素算法)
- POJ 1523-SPF(Tarjan算法-关节点)
- Poj 1523 SPF 关节点
- POJ 1523 SPF tarjan求割点模板
- POJ 1523 SPF tarjan算法入门
- Poj 1523 SPF(割点 + tarjan算法)
- poj1523 SPF 无向连通图 求割点 关节点 tarjan算法
- 【连通图|关节点】POJ-1523 SPF
- poj 1523 SPF 无向图关节点
- POJ 1523 SPF Tarjan求割点
- poj 1523 SPF (tarjan)
- POJ 1523 SPF(Tarjan)
- POJ 1523:SPF tarjan求割点
- POJ 1523 SPF (无向图求割点 tarjan算法)
- POJ 1523 SPF 割点与桥的判断算法-Tarjan
- poj 1523 SPF(无向图求关节点)
- POJ 1253 SPF(tarjan算法求割点)
- 操作系统_优先级反转、优先级继承
- 将博客搬至CSDN
- 欢迎使用CSDN-markdown编辑器
- JAVA 上机作业5.19
- JavaP185eg5.4输出反向整数
- poj 1523 SPF(模板题)(Tarjan 关节点的朴素算法)
- iOS常用设计模式
- python学习--异常
- UE3 性能调试:动态光照环境
- codeforce 527B
- 欢迎使用CSDN-markdown编辑器
- CF #325 div1 C + D + hdu 5458
- Java 5.19*
- Handler实现TextView文字闪烁