Tarjan算法1.3HDU 2767 Proving Equivalence(根据入度和出度补全强连通图)

求加最少的边使图为强连通图 #include<cstdio> #include<cstring> #include<algorithm> #include<stack> #include<vector> using namespace std; const int maxn=20000+10; int n,m; vector<int> G[maxn]; stack<int> S; int dfs_

>>阅读原文<<