Last active
March 11, 2019 15:27
-
-
Save Chillee/60e038641437988be00f660dee4410b6 to your computer and use it in GitHub Desktop.
Tarjans Strongly Connected Components (SCC)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
template <int MAXN> struct SCC { | |
int num[MAXN], low[MAXN]; | |
bool curProcess[MAXN]; | |
stack<int> curVis; | |
int dfsCnt = 0; | |
SCC() { fill(begin(num), end(num), -1), fill(begin(low), end(low), -1); } | |
void dfs(int cur) { | |
num[cur] = low[cur] = dfsCnt++; | |
curProcess[cur] = true; | |
curVis.push(cur); | |
for (auto v : adj[cur]) { | |
if (num[v] == -1) | |
dfs(v); | |
if (curProcess[v]) | |
low[cur] = min(low[cur], low[v]); | |
} | |
if (num[cur] == low[cur]) { | |
while (curVis.top() != cur) { | |
int t = curVis.top(); | |
curVis.pop(); | |
low[t] = low[cur]; | |
curProcess[t] = false; | |
} | |
curVis.pop(); | |
curProcess[cur] = false; | |
} | |
} | |
void tarjans() { | |
for (int i = 0; i < N; i++) | |
if (num[i] == -1) | |
dfs(i); | |
} | |
}; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment