割点

为什么判断判断割点中low的转移是low[u] = MIN(low[u], num[v]);而不是low[u] = MIN(low[u], low[v]);

假设x是割点，u是x某一子树的一点，u->v,v==x，那么low[u]的值有可能是low[x]的值，这样再对x进行割点的判定显然是没有意义的。
dfs寻找割点，其实运用到了dfs序的性质，即当判断x是否为割点时，要保证low[x]的值为不通过节点x，x以及x子树节点可回溯的最小dfn。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<climits>
#include<cctype>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<string.h>
using namespace std;
#pragma warning(disable:4996)
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
#define ri(x) scanf("%d",&x)
const int maxn = 20005, maxm = 200005;
int edg[maxm];
int  h[maxn], nxt[maxm], tag[maxn];
int esize = 0;
inline void add(int u, int v)
{
    esize++;
    edg[esize] = v;
    nxt[esize] = h[u];
    h[u] = esize;
}
int low[maxn], num[maxn], dfn = 0, ans = 0;
void trjan(int u,int fa)
{
    low[u] = num[u] = ++dfn;
    int chrild = 0;
    for (int i = h[u]; i; i = nxt[i])
    {
        int v = edg[i];
        if (!num[v])
        {
            chrild++;
            trjan(v, u);
            low[u] = MIN(low[v], low[u]);
            if (low[v] >= num[u] && u != fa)tag[u] = 1;
        }
        else if (num[v] < num[u] && v != fa) low[u] = MIN(low[u], num[v]);
    }
    if (u == fa && chrild >= 2)
    {
        tag[u] = 1;
    }
}
int main()
{
    memset(num, 0, sizeof(num));
    memset(tag, 0, sizeof(tag));
    memset(h, 0, sizeof(h));
    int n, m;
    ri(n);
    ri(m);
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        ri(u), ri(v);
        add(u, v); add(v, u);
    }
    for (int i = 1; i <= n; i++)
    {
        if (!num[i])trjan(i, i);
    }
    for (int i = 1; i <= n; i++)ans += tag[i];
    cout << ans << '\n';
    for (int i = 1; i <= n; i++)
    {
        if (tag[i])
        {
            cout << i << ' ';
        }
    }
}