ACM TJU 1556

Background

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
-----------------------------------------------------------------------------------------------------------手动分割线-------------------------------------------------------------------------------------------------------------------------
题目大意：
　　给定一个有N点的无向连通图，问图中有哪些点去掉后图讲不在联通？同时输出去掉这个点后，图被分为几个联通块。
　　输入包含多组数据，每组以0结尾，每行描述图中边的两个顶点编号。每组数据中间有一个空行。
　　

思路：就是一边找割点，一边求联通分量啦......
代码送上：

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define N 1010
int low[N],dfn[N],sub[N],n,m,cnt,e[N][N],vis[N],son;
void init()
{
    memset(vis,0,sizeof(vis));
    low[1]=dfn[1]=1;
    cnt=1;
    son=0;
    vis[1]=1;
    memset(sub,0,sizeof(sub));
}
void dfs(int u)
{
    for(int v=1;v<=n;v++)
    {
        if(!e[u][v])continue;
        e[v][u]=e[u][v]=0;
        if(!vis[v])
        {
            vis[v]=1;
            cnt++;
            dfn[v]=low[v]=cnt;
            dfs(v);
            if(low[u]>low[v]) low[u]=low[v];
            if(low[v]>=dfn[u])
            {
                if(u!=1) sub[u]++;
                else son++;
            }
        }
        else if(low[u]>dfn[v])low[u]=dfn[v];
    }
}
int main()
{
    int u,v;
    int num=1;
    while(scanf("%d",&u),u)
    {
        memset(e,0,sizeof(e));
        n=0;
        scanf("%d",&v);
        n=max(n,u);
        n=max(n,v);
        e[u][v]=1;
        e[v][u]=1;
        while(scanf("%d",&u),u)
        {
            scanf("%d",&v);
            n=max(n,u);
            n=max(n,v);
            e[u][v]=1;
            e[v][u]=1;
        }
        init();
        dfs(1);

        if(son>1)sub[1]=son-1;
        int flag=0;
        if(num>1)puts("");
        printf("Network #%d\n",num++);
        for(int i=1;i<=n;i++)
        {
            if(sub[i])
            {
                flag=1;
                printf("  SPF node %d leaves %d subnets\n",i,sub[i]+1);
            }
        }
        if(!flag)printf("  No SPF nodes\n");
    }
    return 0;
}