int V,E,cnt=1; vectoradj[MAX_N],discoverd,finished; vectortreeEdge,forwardEdge,backEdge,crossEdge; int dfs(int u) { discoverd[u]=cnt++; for(auto v:adj[u]) { if(!discoverd[v]) { treeEdge[v]=true; dfs(v); } else if(discoverd[u]
int V,E,cnt=1; vectoradj[MAX_N],discoverd; vectorisCutVertex; int findCutVertex(int u,bool isRoot) { discoverd[u]=cnt++; int ret=discoverd[u],child=0; for(auto v:adj[u]) { if(!discoverd[v]) { child++; int subtree=findCutVertex(v,false); if(!isRoot&&subtree>=discoverd[u])isCutVertex[u]=true; ret=min(ret,subtree); } else ret=min(ret,discoverd[v]); } if(isRoot&&child>=2)isCutVertex[u]= true; return..
