poj 1144——Network

题意：给出一个图，要求求出图中的割点个数。题目中给出图的方式不是给出边，而是先给出一个点，然后给出与这个点连接的点。

思路：求割点的模板题

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=105;

int g[maxn][maxn];
int low[maxn];
int dfn[maxn];
int vis[maxn];
int cut[maxn];
int n;

void cut_bridge(int cur,int father,int dep){
    vis[cur]=1;
    dfn[cur]=low[cur]=dep;
    int children=0;
    for(int i=1;i<=n;++i){
        if(g[cur][i]){
            if(i!=father&&1==vis[i]){
                if(dfn[i]<low[cur])low[cur]=dfn[i];
            }
            if(0==vis[i]){
                cut_bridge(i,cur,dep+1);
                children++;
                if(low[i]<low[cur])low[cur]=low[i];
  //              cout<<father<<' '<<children<<' '<<low[i]<<' '<<dfn[cur]<<endl;
                if((father==-1&&children>1)||((father!=-1)&&low[i]>=dfn[cur]))cut[cur]=true;
            }
        }
    }
    vis[cur]=2;
}

int main(){
//    freopen("data.txt","r",stdin);
    while(scanf("%d",&n)!=EOF){
        if(n==0)break;
        memset(g,0,sizeof(g));
        memset(low,0,sizeof(low));
        memset(dfn,0,sizeof(dfn));
        memset(vis,0,sizeof(vis));
        memset(cut,0,sizeof(cut));
        int a;
        while(scanf("%d",&a)){
            if(a==0)break;
            char c;
            int b;
            while(c=getchar()){
                if(c=='\n')break;
                scanf("%d",&b);
                if(b==0)break;
                g[a][b]=1;
                g[b][a]=1;
  //              cout<<a<<' '<<b<<endl;
            }
        }
        for(int i=1;i<=n;++i){
            if(!vis[i])cut_bridge(i,-1,0);
        }
        int ans=0;
        for(int i=1;i<=n;++i){
            if(cut[i])ans++;
  //          cout<<cut[i]<<' ';
        }
    //    cout<<endl;
        printf("%d\n",ans);
    }
    return 0;
}