Topological sorting

17.cpp

void toposort(vector<int> v, stack<int> stck, vector<bool> visited){
  visited[i] = true;
  for(int j=0; j<v[i].size(); j++){
    if(visited[i] == true)
      toposort(v,stck,visited);
  }
  stck.push(v);
}

void driver(vector<int> v){
  vector<bool> visited(n,false);
  for(int i=0; i<v.size(); i++){
    if(visited[i])
      toposort(v,visited,stck);
  }
  while(!stck.empty()){
    cout << stck.top();
    stck.pop();
  }
}