就是标注了114514的那行为什么不是cpp low[u] = min(low[u],low[v]);

void tarjan(int u,int fa) {
	int son = 0;
	dfn[u] = low[u] = ++cnt;
	for (int i = 0;i < g[u].size();i ++) {
		int v = g[u][i];
		if (!dfn[v]) {
			++ son;
			tarjan(v,u);
			low[u] = min(low[u],low[v]);
			if (low[v] >= dfn[u] && u != root) iscut[u] = true;
		} else if (v != fa) low[u] = min(low[u],dfn[v]);//-------------114514
	}
	if (u == root && son >= 2) iscut[u] = true;
	return;
}