#include <iostream>
#include <stack>
#include <vector>

using namespace std;

void topologicalSortUtil(int v, const vector<vector<int>> &adj, vector<bool> &visited, stack<int> &Stack) {
  visited[v] = true;

  for (int i : adj[v]) {
    if (!visited[i]) {
      topologicalSortUtil(i, adj, visited, Stack);
    }
  }

  Stack.push(v);
}

vector<int> topologicalSort(int V, const vector<vector<int>> &adj) {
  stack<int> Stack;
  vector<bool> visited(V, false);

  for (int i = 0; i < V; ++i) {
    if (!visited[i]) {
      topologicalSortUtil(i, adj, visited, Stack);
    }
  }

  vector<int> result;
  while (!Stack.empty()) {
    result.push_back(Stack.top());
    Stack.pop();
  }

  return result;
}

int main() {
  int V = 6;
  vector<vector<int>> adj(V);

  adj[5] = {2, 0};
  adj[4] = {0, 1};
  adj[2] = {3};
  adj[3] = {1};

  vector<int> result = topologicalSort(V, adj);

  cout << "Topological Sort: ";
  for (int v : result) {
    cout << v << " ";
  }
  cout << endl;

  return 0;
}