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_

>>阅读原文<<