POJ 3352 Road Construction 边双连通分量 缩点

题意：给一个无向图，求在图中最少加多少条边使得图变为边双连通图
边双连通图：若一个无向图去掉任意一条边都不会改变这个图的连通性，即不存在桥，则称该图为边双连通图
思路：对每个点求一次tarjan，low值相同的点在同一个边双连通分量里，将这些点缩在一个点里，求出缩点之后图中每个点的度数，需要加的边数等于(度数为1的点的数量+1)/2

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<stack>
using namespace std;
typedef long long ll;
const int maxn = 1005;
const int inf = 0x3f3f3f3f;
int dfn[maxn], low[maxn], cnt, ans, n, m, isbrige[maxn], degree[maxn];
vector<int> g[maxn];
void tarjan(int x, int fa)
{
	dfn[x] = low[x] = ++cnt;
	for (int i = 0; i < g[x].size(); i++) {
		int v = g[x][i];
		if (dfn[v] < dfn[x] && v != fa) {
			if (!dfn[v]) {
				tarjan(v, x);
				low[x] = min(low[x], low[v]);
			}
			else
				low[x] = min(low[x], dfn[v]);
		}
	}
}
int main()
{
	while (cin >> n >> m) {
		memset(dfn, 0, sizeof(dfn));
		memset(degree, 0, sizeof(degree));
		cnt = 0, ans = 0;
		for (int i = 0; i < m; i++) {
			int u, v;
			cin >> u >> v;
			g[u].push_back(v);
			g[v].push_back(u);
		}
		for (int i = 1; i <= n; i++) {
			if (!dfn[i])
				tarjan(i, -1);
		}
		for (int i = 1; i <= n; i++)
			for (int j = 0; j < g[i].size(); j++) {
				int v = g[i][j];
				if (low[i] != low[v])
					degree[low[v]]++;
			}
		for (int i = 1; i <= n; i++)
			if (degree[i] == 1)
				ans++;
		cout << (ans+1)/2 << endl;
	}
}