TopologicalSort

1
auto res = topologicalSord(g);

1
vector<int> topologicalSort(DirectedGraph &_g) {
2
  vector<int> d, ind(_g.n);
3
  for (int i = 0; i < _g.n; i++)
4
    for (auto e : _g.g[i])
5
      ind[e.to]++;
6
  queue<int> que;
7
  for (int i = 0; i < _g.n; i++)
8
    if (ind[i] == 0)
9
      que.push(i);
10
  while (!que.empty()) {
11
    int now = que.front();
12
    d.push_back(now);
13
    que.pop();
14
    for (auto e : _g.g[now]) {
15
      ind[e.to]--;
16
      if (ind[e.to] == 0)
17
        que.push(e.to);
18
    }
19
  }
20
  return d;
21
}