qq_40492793的博客

#include<bits/stdc++.h> using namespace std; #define maxn 20 int vis[maxn]={0}; int dfs[maxn]; int low[maxn]; int cnt; stack<int> s; bool instack[maxn] = {false}; void Tarjan(int cur); int Map[maxn][maxn]; int n,m; int tol,t; //6 8 //1 3 //1 2 //2 4 //3 4 //3 5 //4 1 //4 6 //5 6 int main() { cin>>n>>m; int x,y; for(int i=0;i<m;i++){ cin>>x>>y; Map[x][y]=1; } Tarjan(1); cout<<tol; return 0; } void Tarjan(int cur){ vis[cur]=1; dfs[cur] = low[cur] = cnt++; s.push(cur); instack[cur] = true; // printf("%d\n",cur); for(int i=1;i<=n;i++){ if(vis[i]!=1&&Map;[cur][i]==1){ Tarjan(i); low[cur] = min(low[cur],low[i]); } else if(instack[i]&&Map;[cur][i]==1){//为了 防止有些边是别的连有通图里面的 仅仅与此点有单连同 low[cur] = min(low[cur],dfs[i]); } } if(dfs[cur] == low[cur]){ do{ t = s.top(); s.pop(); instack[t]=false; }while(t!=cur); tol++; } }