# 割点和桥问题 poj1144模板题

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;
bool cut[MAX];//点1~n是否是割点
int n,cnt,k,root;
struct Edge
{
int to,next;
}edge[MAX*MAX];
{
edge[cnt].to=cv;
}
void tarjan(int u,int fa)
{
int son=0;
visited[u]=1;
dfn[u]=low[u]=++k;
{
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(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);
}
}
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;
bool cut[MAX];//点1~n是否是割点
int n,cnt,k,root,nume;nume桥的个数
struct Edge
{
int to,next;
}edge[MAX*MAX],cutm[MAX*MAX];//cutm是桥
{
edge[cnt].to=cv;
}
void tarjan(int u,int fa)
{
int son=0;
visited[u]=1;
dfn[u]=low[u]=++k;
{
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(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);
}
}
//、、、、、、、、、、、、
root=1;
tarjan(root,-1);
int ans=0;
for(int i=1;i<=n;i++)
if(cut[i])
ans++;
cout<<ans<<endl;//输出割点个数
}

• 本文已收录于以下专栏：

## POJ1144Network(割边模板题)

Network Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 13771   Accep...

## poj_1144/uva_315/zoj_1311 Network（割點模板題）

• xyinktw
• 2014年07月26日 00:31
• 377

## POJ1144Network(求割点模板题)

Network Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7990   Accept...

## poj 1144 Network （割点模板）

Network Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 9535   Accept...

## 基于DFS求无向图的割点及桥（割边）算法总结 POJ_1144题解

1.割点，桥（割边）定义： 若v2（v1的后继节点）有且仅有反向边最远连接到v1，那么删除v1后不连通，v1是割点。作为一种特殊情况，如果v2及其后代通过反向边只能连回v2自己,那么只要删除edge...
• zl_130
• 2015年08月13日 16:43
• 175