点双&边双模板

跟jxp大佬对了一下模板，对拍了一下，发现我写的边双、jxp写的点双是错的。。。
于是，我们还是互相借鉴了一下模板。。。

点双、边双基础知识

一位大佬的博客

点双模板

主要思路：由于求点双时，割点会存在于多个点双中，所以不好记录点。所以决定采用记边。

//...IO etc.
const int MAXN = 1e6 + 5;
const int MAXM = 1e6 + 5;
int n, m;
struct Edge {
	int v, nxt, id;
}e[MAXM << 1];
int head[MAXN], cnt = 1;
void addedge(int u, int v, int id) {
	e[++cnt].v = v;
	e[cnt].nxt = head[u];
	e[cnt].id = id;
	head[u] = cnt;
}
int dfn[MAXN], low[MAXN], tim;
int g[MAXN], gg;
int stk[MAXN], top;
int ans;
void tarjan(int u, int fa) {
	dfn[u] = low[u] = ++tim;
	for(rg int i = head[u]; i; i = e[i].nxt) {
		int v = e[i].v; if(v == fa) continue;
		stk[++top] = i;
		if(!dfn[v]) {
			tarjan(v, u);
			low[u] = Min(low[u], low[v]);
			if(low[v] >= dfn[u]) {
				int x, y;
				gg++;
				do {
					x = e[stk[top]].v; y = e[stk[top] ^ 1].v; top--;
					if(g[x] != gg) g[x] = gg;
					if(g[y] != gg) g[y] = gg;
				}while(x != v || y != u);
			}
		}
		else low[u] = Min(low[u], dfn[v]);
		
	}
}


int main() {
	//RS();
	n = read(), m = read();
	for(rg int i = 1; i <= m; i++) {
		int u = read(), v = read();
		addedge(u, v, i);
		addedge(v, u, i);
	}
	for(rg int i = 1; i <= n; i++)
		if(!dfn[i])
	tarjan(1, 0);
	writeln(gg - 1);
	return 0;
}

边双

割掉桥，跑dfs就好了

//IO etc.

const int MAXN = 100005;
const int MAXM = 100005;
int n, m;
struct Edge {
	int v, nxt;
}e[MAXM << 1];
int head[MAXN], cnt = 1;
void addedge(int u, int v) {
	e[++cnt].v = v;
	e[cnt].nxt = head[u];
	head[u] = cnt;
}

int tim, dfn[MAXN], low[MAXN];
bool cut[MAXN];
void tarjan(int u, int fa) {
	dfn[u] = low[u] = ++tim;
	for(rg int i = head[u]; i; i = e[i].nxt) {
		int v = e[i].v; if(v == fa) continue;
		if(!dfn[v]) {
			tarjan(v, u);
			low[u] = Min(low[u], low[v]);
			if(low[v] > dfn[u]) cut[i] = cut[i ^ 1] = 1;
		} else low[u] = Min(low[u], dfn[v]);
	}
}
bool vis[MAXN];
void dfs(int u) {
	vis[u] = 1;
	for(rg int i = head[u]; i; i = e[i].nxt)
		if(!vis[e[i].v] && !cut[i])
			dfs(e[i].v);
}
int main() {
	//RS();
	n = read(); m = read();
	for(rg int i = 1; i <= m; i++) {
		int u = read(), v = read();
		addedge(u, v);
		addedge(v, u);
	}
	for(rg int i = 1; i <= n; i++)
		if(!dfn[i]) tarjan(i, 0);
	int ans = 0;
	for(rg int i = 1; i <= n; i++)
		if(!vis[i]) ans++, dfs(i);
	writeln(ans);

	return 0;
}