poj1523(无向图求割点)
来源:互联网 发布:js判断是否在数组中 编辑:程序博客网 时间:2024/06/05 10:40
SPF
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4085 Accepted: 1888
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.
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.
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
无向图求割点,并求删去割点能把图分成几块。
#include<stdio.h>#include<string.h>struct node{ int to; int next;} p[1005*1005];int dfn[1005],low[1005];int vis[1005];int cut[1005],head[1005];int n,e,idex;int root,root_son;int max(int a,int b){ return a<b?b:a;}void add(int u,int v){ p[e].to=v; p[e].next=head[u]; head[u]=e++;}void findCut(int u){ dfn[u]=low[u]=idex++; for(int i=head[u]; i!=-1; i=p[i].next) { int v=p[i].to; if(!dfn[v]) { findCut(v); if(u==root) root_son++; else { if(low[v]<low[u]) low[u]=low[v]; if(low[v]>=dfn[u]) cut[u]=1; } } else if(low[u]>dfn[v]) low[u]=dfn[v]; }}void dfs(int s){ vis[s]=1; for(int i=head[s]; i!=-1; i=p[i].next) { int v=p[i].to; if(!vis[v]) { vis[v]=1; dfs(v); } }}int main(){ int u,v,t=0; while(scanf("%d",&u)&&u) { t++; n=-1; e=0; idex=1; memset(dfn,0,sizeof(dfn)); memset(low,0,sizeof(low)); memset(vis,0,sizeof(vis)); memset(cut,0,sizeof(cut)); memset(head,-1,sizeof(head)); n=max(n,u); scanf("%d",&v); n=max(n,v); add(u,v); add(v,u); while(scanf("%d",&u)&&u) { n=max(n,u); scanf("%d",&v); n=max(n,v); add(u,v); add(v,u); } root=1; int flag=0; root_son=0; findCut(root); if(root_son>1) cut[root]=1; printf("Network #%d\n",t); for(int i=1; i<=n; i++) { if(cut[i]) { flag=1; memset(vis,0,sizeof(vis)); vis[i]=1; int son=0; for(int j=head[i]; j!=-1; j=p[j].next) { if(!vis[p[j].to]) { dfs(p[j].to); son++; } } printf(" SPF node %d leaves %d subnets\n",i,son); } } if(!flag) printf(" No SPF nodes\n"); printf("\n"); } return 0;}
- poj1523(无向图求割点)
- POJ1523 SPF (无向图求割点)
- 无向图的割顶(poj1523,1144)
- poj1523—SPF(tarjan算法求无向图中所有的割点)
- poj1523 SPF 无向连通图 求割点 关节点 tarjan算法
- 【POJ1523】SPF 不太单纯的无向图求割点啦啦啦
- POJ1523.SPF——无向图的割点,并求连通分支数(tarjan算法)
- POJ1523 SPF (求割点)
- poj1523(割点)
- poj1523
- poj1523
- poj1523
- poj1523
- POJ 1523 SPF (无向图求割点)
- UVA 315 Network(无向图求割点)
- uva 315 Network(无向图求割点)
- POJ 1144 Network (无向图求割点)
- 【无向图求割点】
- 在Heroku上部署Java应用-连接数据库
- Impala学习--Impala系统架构
- Android系统Recovery工作原理之使用update.zip升级过程分析(七)---Recovery服务的核心install_package函数
- redhat linux KVM虚拟机桥接
- libcurl的android移植
- poj1523(无向图求割点)
- 2.类型与值
- Oracle建立DBLINK的详细步骤记录
- C#学习笔记—LINQ
- mongodb常用管理命令
- iOS单例模式的实现
- hadoop的产生
- shell 下执行mysql 命令
- MongoDB命令及SQL语法对比