割点和桥模板

#include<stdio.h>
#include <iostream> 
#include <string.h>
#include <vector> 
using namespace std;  
#define MyMax 200 
typedef vector<int> Edge;
vector<Edge> G(MyMax); 
bool Visited[MyMax] ; 
int dfn[MyMax] ; 
int low[MyMax] ; 
int Father[MyMax]; //DFS树中每个点的父节点 
bool bIsCutVetext[MyMax]; //每个点是不是割点 
int nTime; //Dfs时间戳 
int n,m; //n是点数，m是边数
void Tarjan(int u, int father) //father 是u的父节点 
{
	Father[u] = father;  
	low[u] = dfn[u] = nTime ++;  
	for(int i = 0;i < G[u].size() ;i ++ ) 
	{
		int v = G[u][i];   
		if( ! dfn[v]) 
		{    
			Tarjan(v,u);    
			low[u] = min(low[u],low[v]);   
		}   
		else if( father != v ) // 连到父节点的回边不考虑， 否则求不出桥    
			low[u] = min(low[u],dfn[v]);  
	} 
}
void Count() 
{ //计算割点和桥  
	int nRootSons = 0; 
	int i;  
	Tarjan(1,0);  
	for( i = 2;i <= n;i ++ ) 
	{   
		int v = Father[i];   
		if( v == 1 )    
			nRootSons ++; //DFS树中根节点有几个子树   
		else 
		{    
			if( dfn[v] <= low[i])     
				bIsCutVetext[v] = true;   
		}  
	}  
	if( nRootSons > 1)   
		bIsCutVetext[1] = true;  
	for( i = 1;i <= n;i ++ )   
		if( bIsCutVetext[i] )    
			cout << i << endl;  
	for( i = 1;i <= n;i ++) 
	{   
		int v = Father[i];   
		if(v >0 &&  dfn[v] < low[i])    
			cout << v << "," << i <<endl;  
	} 
}
int main() 
{  
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
	int u,v;  
	int i;   
	nTime = 1;  
	cin >> n >> m ; //n是点数，m是边数  
	for(  i = 1;i <= m;i ++ ) 
	{   
		cin >> u >> v; //点编号从1开始   
		G[v].push_back(u);   
		G[u].push_back(v);  
	}  
	memset( dfn,0,sizeof(dfn));  
	memset( Father,0,sizeof(Father));  
	memset( bIsCutVetext,0,sizeof(bIsCutVetext));  
	Count();  
	return 0; 
} 

Input: （11点13边）  

11 13

1 2

1 4

1 5

1 6

2 11

2 3

4 3

4 9

5 8

5 7

6 7

7 10

11 3  

output:

1 

4

5

7

5,8

4,9

7,10