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.
![](https://i-blog.csdnimg.cn/blog_migrate/174c017dd19df5f4745d501731a36738.jpeg)
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 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
思路:
用tarjan求出割点和分的块数。
求每一个割点分割出的块数时,应记录在总的块数中该割点出现的次数,而不能仅仅依据临点有几个不同的颜色来判断分割成了几块(如果一个割点的临点也包括一个割点时可能不成立)。
代码:
#include<cstdio>
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
int n,m;
vector<int> a[1001];
int dfn[1001]= {0},low[1001]= {0};
int color[1001]= {0},s=0;
int stack[1001]= {0},top=0;
int clock=0;
map<int,int> instack;
vector<int> b;
int child[1001]= {0}; //个点分割块数的记录
int tarjan(int x,int fa) {
dfn[x]=low[x]=++clock;
instack[x]=++top;
stack[top]=x;
bool flag=false;
int x1=0;
for(int i=0; i<a[x].size(); i++) {
if(!instack.count(a[x][i])) { //没有到过这个点
x1++;
int y=tarjan(a[x][i],x);
low[x]=min(low[x],y);
if(y>=dfn[x]) { //点x为割点
flag=true;
s++;
for(int i=instack[x]; i<=top; i++) {
color[stack[i]]=s;
child[stack[i]]++;
}
top=instack[x];
}
} else if(a[x][i]!=fa) { //反向边
low[x]=min(low[x],dfn[a[x][i]]);
}
}
if((x==1&&x1>=2)|(flag==true&&x!=1)) { //跟节点1单独讨论
b.push_back(x);
child[1]=x1;
}
return low[x];
}
int main() {
int t=0;
while(1) {
t++;
s=0; //初始化
n=0;
m=0;
top=0;
clock=0;
instack.clear();
b.clear();
for(int i=1; i<=1000; i++) {
a[i].clear();
child[i]=0;
dfn[i]=0;
low[i]=0;
}
map<int,int> num;
int num2[1001]= {0};
while(1) {
int x,y;
scanf("%d",&x);
if(x==0) {
break;
}
m++;
scanf("%d",&y);
if(!num.count(x)) {
num[x]=++n;
num2[n]=x;
}
if(!num.count(y)) {
num[y]=++n;
num2[n]=y;
}
a[num[x]].push_back(num[y]);
a[num[y]].push_back(num[x]);
}
if(m==0) {
break;
}
printf("Network #%d\n",t); //打印
tarjan(1,0);
if(b.size()==0) {
printf(" No SPF nodes\n");
} else {
sort(b.begin(),b.end());
for(int i=0; i<b.size(); i++) {
printf(" SPF node %d leaves %d subnets\n",num2[b[i]],child[b[i]]);
}
}
printf("\n");
}
return 0;
}