POJ-1144NetWork

Description

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bidirectional and always connect together two places and in each place the lines end in a telephone exchange. There is one telephone exchange in each place. From each place it is 
possible to reach through lines every other place, however it need not be a direct connection, it can go through several exchanges. From time to time the power supply fails at a place and then the exchange does not operate. The officials from TLC realized that in such a case it can happen that besides the fact that the place with the failure is unreachable, this can also cause that some other places cannot connect to each other. In such a case we will say the place (where the failure 
occured) is critical. Now the officials are trying to write a program for finding the number of all such critical places. Help them.

Input

The input file consists of several blocks of lines. Each block describes one network. In the first line of each block there is the number of places N < 100. Each of the next at most N lines contains the number of a place followed by the numbers of some places to which there is a direct line from this place. These at most N lines completely describe the network, i.e., each direct connection of two places in the network is contained at least in one row. All numbers in one line are separated 
by one space. Each block ends with a line containing just 0. The last block has only one line with N = 0;

Output

The output contains for each block except the last in the input file one line containing the number of critical places.

题目大意：给你n个点，然后给你最多n行，其中每行第一个数表示一个原点，其余的数都与这个点相连，现在问你有多少关键点使得切断这些点整个网络将不连通。

很显然是要求整个图中的割顶（删除之后不再使图连通的点），那么可以套一套刘汝佳白书上的模板就可以了，下面讲讲自己学习割顶和桥的体会，其实当判断一个点是不是割顶时，假设为点A，最主要的是要判断它是否存在一个子结点B使得B与A的父节点C不

相连的情况，因为当B与C不相连时，我切断A与B的联系，那么B与C就不再有联系了，那么整个连通图就变得不连通了，由此B就是

割顶了，在代码中集中体现的是lowv>=pre[u]，另外一点是要注意随时更新lowu的值，因为lowu的值受到多方面的影响。

下面是代码：(话说这题输入有点恶心)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
const int maxn=105;
int N,pre[maxn],low[maxn],dfs_clock,cnt=0,iscut[maxn];
vector<int> G[maxn];
void init()
{
    for(int i=1;i<maxn;i++)
            G[i].clear();
     memset(pre,0,sizeof(pre));
     memset(low,0,sizeof(low));
     memset(iscut,0,sizeof(iscut));
     cnt=0;
     dfs_clock=0;
}
int dfs(int u,int fa)
{
    int lowu=pre[u]=++dfs_clock;
    int child=0;
    for(int i=0;i<G[u].size();i++)
    {
        int v=G[u][i];
        if(!pre[v])
        {
            child++;
            int lowv=dfs(v,u);
            lowu=min(lowv,lowu);
            if(lowv>=pre[u])
            {
                iscut[u]=1;
            }
        }
        else if(pre[v]<pre[u]&&v!=fa)
                lowu=min(lowu,pre[v]);
    }
    if(fa<0&&child==1)
        iscut[u]=0;
    low[u]=lowu;
    return lowu;
}
int main()
{
     while(scanf("%d",&N)!=EOF&&N)
     {
         int u, v;
        init();
        while(scanf("%d", &u), u) {
            while(getchar() != '\n') {
                scanf("%d", &v);

                G[u].push_back(v);
                G[v].push_back(u);
            }
        }
          dfs(1,-1);
          for(int i=1;i<=N;i++)
            if(iscut[i])
              cnt++;
          printf("%d\n",cnt);

     }
     return 0;
}