无向图的割点和桥

割点（割顶）：无向连通图中，删除某点后，图变成不连通，称该点为割点；

桥：无向连通图中，如果删除某条边后，图变成不连通，则该边称为桥；

定理：在无向连通图的dfs树中，非根节点u是割点当且仅当u存在一个子节点v使得v及其所有后代都没有反向边连回u的祖先（连回u不算）

求割点的Tarjan算法：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<string>
#define ll long long
#define MAX 1000
#define INF INT_MAX
#define eps 1e-8

using namespace std;

int pre[MAX],mark[MAX],low[MAX],dfs_clock;  //mark[i]用来标记节点是否为割点 

vector<int>G[MAX];

int n;

void init(){
	for (int i=0; i<=n; i++) G[i].clear();
	memset(pre,0,sizeof(pre));
	memset(mark,0,sizeof(mark));
	dfs_clock = 0;
}

int dfs(int u, int fa){
	int lowu = pre[u] = ++dfs_clock;
	int c = 0;
	for (int i=0; i<G[u].size(); i++){
		int v = G[u][i];
		if (!pre[v]){
			c++;
			int lowv = dfs(v,u);
			lowu = min(lowu,lowv);
			if (lowv >= pre[u]){    //判断节点u是不是存在一子节点v，使得v以及其所有后代都没有反边连回u的祖先 
				mark[u] = 1;
			}
		}
		else if (pre[v] < pre[u] && v != fa){  //注意不再考虑连到父亲节点的回边； 
			lowu = min(lowu,pre[v]);
		}
	} 
	if (fa < 0 && c == 1) mark[u] = 0;  //当且仅当根节点有多个孩子节点时才是割点
	low[u] = lowu;
	return lowu; 
}

int main(){
	int m;
	while(scanf("%d%d",&n,&m) != EOF){
		init();
		int u,v;
		for (int i=0; i<m; i++){
			scanf("%d%d",&u,&v);
			G[u].push_back(v);
			G[v].push_back(u);
		}
		dfs(1,-1);
		for (int i=1; i<=n; i++) if (mark[i]) printf("%d ",i); printf("\n");
	}
	return 0;
}

求无向图的桥算法：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<string>
#define ll long long
#define MAX 1000
#define INF INT_MAX
#define eps 1e-8

using namespace std;

struct Edge{
	int u, v;
};

int pre[MAX],low[MAX],dfs_clock; 

vector<int>G[MAX];
vector<Edge> edges;   //记录桥 

int n;

void init(){
	for (int i=0; i<=n; i++) G[i].clear();
	edges.clear();
	memset(pre,0,sizeof(pre));
	dfs_clock = 0;
}

int dfs(int u, int fa){
	int lowu = pre[u] = ++dfs_clock;
	int c = 0;
	for (int i=0; i<G[u].size(); i++){
		int v = G[u][i];
		if (!pre[v]){
			c++;
			int lowv = dfs(v,u);
			lowu = min(lowu,lowv);
			if (lowv > pre[u]){    //注意和割点的区别，对于u的子节点v，v的后代只能连回自己，则（u，v）为桥 
				edges.push_back((Edge){u,v});
			}
		}
		else if (pre[v] < pre[u] && v != fa){  
			lowu = min(lowu,pre[v]);
		}
	} 
	low[u] = lowu;
	return lowu; 
}

int main(){
	int m;
	while(scanf("%d%d",&n,&m) != EOF){
		init();
		int u,v;
		for (int i=0; i<m; i++){
			scanf("%d%d",&u,&v);
			G[u].push_back(v);
			G[v].push_back(u);
		}
		dfs(1,-1);
		for (int i=0; i<edges.size(); i++){
			printf("%d %d\n",edges[i].u,edges[i].v);
		}
	}
	return 0;
}