割点
算法流程
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector <int> e[20001];
int dfn[20001],low[20001],timer;
bool gd[20001];
int ans;
void tarjan(int x,int fa)
{
dfn[x] = low[x] = ++timer;
int child = 0;
for (int i = 0; i < e[x].size(); i++)
{
if(!dfn[e[x][i]])
{
tarjan(e[x][i],fa);
low[x] = min(low[x]