割点和桥问题 poj1144模板题

原创 2016年05月30日 17:29:50

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.

Sample Input

5
5 1 2 3 4
0
6
2 1 3
5 4 6 2
0
0

Sample Output

1
2

Hint

You need to determine the end of one line.In order to make it's easy to determine,there are no extra blank before the end of each line.





#include <iostream>
#include <algorithm>
#include <cstring>
#include<cstdio>
#include<string>
#include<cmath>
#include<cstdlib>
#include<vector>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;
const int MAX=110;
int dfn[MAX],low[MAX],head[MAX],visited[MAX];
bool cut[MAX];//点1~n是否是割点
int n,cnt,k,root;
struct Edge
{
    int to,next;
}edge[MAX*MAX];
void addedge(int cu,int cv)
{
    edge[cnt].to=cv;
    edge[cnt].next=head[cu];
    head[cu]=cnt++;
}
void tarjan(int u,int fa)
{
    int son=0;
    visited[u]=1;
    dfn[u]=low[u]=++k;
    for(int i=head[u];i!=-1;i=edge[i].next)
    {
        int v=edge[i].to;
        if(visited[v]==1&&v!=fa)
            low[u]=min(low[u],dfn[v]);
        if(visited[v]==0)
        {
            tarjan(v,u);
            son++;
            low[u]=min(low[u],low[v]);
            if((u==root&&son>1)||(u!=root&&dfn[u]<=low[v]))
                cut[u]=1;
        }
    }
    visited[u]=2;
}
int main()
{
    while(cin>>n)
    {
        if(n==0)
            return 0;
        memset(head,-1,sizeof(head));
        memset(dfn,0,sizeof(dfn));
        memset(low,0,sizeof(low));
        memset(visited,0,sizeof(visited));
        memset(cut,0,sizeof(cut));
        cnt=0;
        int u,v;
        while(scanf("%d",&u) && u){
            while(getchar()!='\n'){
                scanf("%d",&v);
                addedge(u,v);
                addedge(v,u);
            }
        }
        root=1;
        tarjan(root,-1);
        int ans=0;
        for(int i=1;i<=n;i++)
            if(cut[i])
                ans++;
        cout<<ans<<endl;
    }
    return 0;
}





求割点和桥模板:
const int MAX=110;
int dfn[MAX],low[MAX],head[MAX],visited[MAX];
bool cut[MAX];//点1~n是否是割点
int n,cnt,k,root,nume;nume桥的个数
struct Edge
{
    int to,next;
}edge[MAX*MAX],cutm[MAX*MAX];//cutm是桥
void addedge(int cu,int cv)
{
    edge[cnt].to=cv;
    edge[cnt].next=head[cu];
    head[cu]=cnt++;
}
void tarjan(int u,int fa)
{
    int son=0;
    visited[u]=1;
    dfn[u]=low[u]=++k;
    for(int i=head[u];i!=-1;i=edge[i].next)
    {
        int v=edge[i].to;
        if(visited[v]==1&&v!=fa)
            low[u]=min(low[u],dfn[v]);
        if(visited[v]==0)
        {
            tarjan(v,u);
            son++;
            low[u]=min(low[u],low[v]);
            if((u==root&&son>1)||(u!=root&&dfn[u]<=low[v]))
                cut[u]=1;
//if(dfn[u]<low[v]) cute[++nume]=Edge(u,v);
求桥
        }
    }
    visited[u]=2;
}
int main()
{
    while(cin>>n)
    {
        if(n==0)
            return 0;
        memset(head,-1,sizeof(head));
        memset(dfn,0,sizeof(dfn));
        memset(low,0,sizeof(low));
        memset(visited,0,sizeof(visited));
        memset(cut,0,sizeof(cut));
        cnt=0;
//构造边
        int u,v;
        while(scanf("%d",&u) && u){
            while(getchar()!='\n'){
                scanf("%d",&v);
                addedge(u,v);
                addedge(v,u);
            }
        }
//、、、、、、、、、、、、
        root=1;
        tarjan(root,-1);
        int ans=0;
        for(int i=1;i<=n;i++)
            if(cut[i])
                ans++;
        cout<<ans<<endl;//输出割点个数
    }


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

算法学习——求割点与桥的tarjan算法 HDU4738

前天打周赛做到 HDU4738  绞尽脑汁都没想到用什么好的方法来解决这个问题   周赛结束之后跟Yasola和xcy讨论了一下居然用到  tarjan算法   exm???  tarjan不是用来求...

poj1236:Network of School(Tarjan)

Description 一些学校连入一个电脑网络。那些学校已订立了协议:每个学校都会给其它的一些学校分发软件(称作“接受学校”)。注意如果 B 在 A 学校的分发列表中,那么 A 不必也在 B 学校...

POJ1144

POJ1144 典型求割点和桥的算法cut_bridge() 题意:给定一个无向图,求此无向图割点数(当你去掉其中一个点时,形成两个连通分量,此点即是割点) 输入: 给出一个数...

POJ 1144 Network(无向图连通分量求割点)

题目地址:POJ 1144 求割点。判断一个点是否是割点有两种判断情况: 如果u为割点,当且仅当满足下面的1条 1、如果u为树根,那么u必须有多于1棵子树 2、如果u不为树根,那么(u,v)为...

poj 1144 Network【无向图求割顶模板题】

Description A Telephone Line Company (TLC) is establishing a new telephone cable network. They ar...

Tarjan三大算法之双连通分量(割点,桥)

Robert Endre Tarjan是一个美国计算机学家,他传奇的一生中发明了无数算法,统称为Tarjan算法。其中最著名的有三个,分别用来求解 1) 无向图的双连通分量 2) 有向图的强连通分...

poj 1144——Network

题意:给出一个图,要求求出图中的割点个数。 思路:

POJ 2186 Popular Cows(tarjan求强连通)

Popular Cows Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 35096   Accepted: 14...

poj&nbsp;1144&nbsp;求图的割点

题意:题目目给出一个网络连接图 , 要求出图中割点数量 注意:要判断图是否是连通图 , 和数据的输入方式 代码: #include #include #include using namespa...

割点、割边、强连通分量

补上以前看啊哈算法中割边割点的求法,忘了写读书笔记了,先贴上代码,以后再来补上概念性的问题。 割点 //割点,啊哈算法 #include #include #include using nam...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)