4.2.3 Strongly Connected Components (Tarjan)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124

/*

Given a directed graph, determine the strongly connected components (SCCs) using Tarjan's algorithm.
A strongly connected component is a maximal set of vertices where every vertex can reach every other
vertex. Condensing each SCC into one node produces a directed acyclic graph. A single depth-first
search keeps visited nodes on a stack and tracks each node's low-link, the smallest entry time
reachable from its subtree; a node whose low-link equals its own entry time roots a component, which
is popped off the stack in one piece.

- `TarjanSCC(n)` constructs a directed graph of `n` nodes numbered [0, `n`).
- `add_edge(u, v)` adds the directed edge from `u` to `v`.
- `build_scc()` populates `scc` with the strongly connected components and `component[v]` with
  the component ID containing vertex `v`. Component IDs are in reverse topological order: for every
  edge from component $a$ to a different component $b$, $a > b$.

Time Complexity:
- O(max(n, m)) per call to `build_scc()`, where $n$ is the number of nodes and $m$ is the number of
  edges.

Space Complexity:
- O(max(n, m)) for storage of the graph, SCCs, and component IDs.
- O(n) auxiliary stack space.

*/

#include <algorithm>
#include <climits>
#include <vector>

struct TarjanSCC {
  static const int INF = INT_MAX / 2;
  std::vector<std::vector<int>> adj, scc;
  std::vector<int> component, stack, lowlink;
  std::vector<bool> visited;
  int timer;

  TarjanSCC(int n = 0) : adj(n) {}

  void add_edge(int u, int v) { adj[u].push_back(v); }

  void dfs(int u) {
    lowlink[u] = timer++;
    visited[u] = true;
    stack.push_back(u);
    bool is_component_root = true;
    for (int v : adj[u]) {
      if (!visited[v]) {
        dfs(v);
      }
      if (lowlink[u] > lowlink[v]) {
        lowlink[u] = lowlink[v];
        is_component_root = false;
      }
    }
    if (!is_component_root) {
      return;
    }
    std::vector<int> comp_nodes;
    int id = static_cast<int>(scc.size());
    int v;
    do {
      v = stack.back();
      stack.pop_back();
      lowlink[v] = INF;  // marks v as removed from the stack
      component[v] = id;
      comp_nodes.push_back(v);
    } while (u != v);
    scc.push_back(comp_nodes);
  }

  void build_scc() {
    int n = static_cast<int>(adj.size());
    scc.clear();
    component.assign(n, -1);
    stack.clear();
    lowlink.assign(n, 0);
    visited.assign(n, false);
    timer = 0;
    for (int i = 0; i < n; i++) {
      if (!visited[i]) {
        dfs(i);
      }
    }
  }
};

/*** Example Usage and Output:

Components:
5 6
7 3 2
4 1 0

***/

#include <iostream>
using namespace std;

int main() {
  TarjanSCC g(8);
  g.add_edge(0, 1);
  g.add_edge(1, 2);
  g.add_edge(1, 4);
  g.add_edge(1, 5);
  g.add_edge(2, 3);
  g.add_edge(2, 6);
  g.add_edge(3, 2);
  g.add_edge(3, 7);
  g.add_edge(4, 0);
  g.add_edge(4, 5);
  g.add_edge(5, 6);
  g.add_edge(6, 5);
  g.add_edge(7, 3);
  g.add_edge(7, 6);
  g.build_scc();
  cout << "Components:" << endl;
  for (auto &component : g.scc) {
    for (int v : component) {
      cout << v << " ";
    }
    cout << endl;
  }
  return 0;
}