a/Library
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Wrap everything into a struct

Browse source
This commit is contained in:
Anthony Wang 2020-08-21 15:21:02 -05:00
parent 0f80ef68d7
commit 4f1ef57c5c
No known key found for this signature in database
GPG key ID: DCDAC3EF330BB9AC
1 changed files with 23 additions and 24 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

47
Graph/tarjan_scc.cpp
View file

@ -1,25 +1,24 @@
int cnt, scc_num, scc[MN], in[MN], low[MN];
stack<int> s;
bitset<MN> ins;
void tarjan(int u) {
low[u] = in[u] = cnt++;
s.push(u);
ins[u] = 1;
for (int v : G[u]) {
if (in[v] == -1) tarjan(v), low[u] = min(low[u], low[v]);
else if (ins[v]) low[u] = min(low[u], in[v]);
}
if (low[u] == in[u]) {
while (1) {
int x = s.top(); s.pop();
scc[x] = scc_num, ins[x] = 0;
if (x == u) break;
}
++scc_num;
}
struct tarjan {
int cnt, scc_num, scc[MN], in[MN], low[MN];
stack<int> s;
bitset<MN> ins;
void tarjan(vector<int> * G, int u) {
low[u] = in[u] = cnt++, ins[u] = 1; s.push(u);
for (int v : G[u]) {
if (in[v] == -1) tarjan(G, v), low[u] = min(low[u], low[v]);
else if (ins[v]) low[u] = min(low[u], in[v]);
}
if (low[u] == in[u]) {
while (1) {
int x = s.top(); s.pop();
scc[x] = scc_num, ins[x] = 0;
if (x == u) break;
}
++scc_num;
}
}
void find_scc(vector<int> * G) {
memset(scc, -1, sizeof scc), memset(in, -1, sizeof in);
for (int u = 1; u <= N; ++u) if (scc[u] == -1) tarjan(G, u);
}
}
memset(scc, -1, sizeof scc), memset(in, -1, sizeof in);
for (int u = 1; u <= N; ++u) if (scc[u] == -1) tarjan(u);