| 29 | } |
| 30 | |
| 31 | void topo_rec(vector<int> vec[], int v) |
| 32 | { |
| 33 | vector<bool> visited(v, false); |
| 34 | stack<int> s; |
| 35 | for (int i = 0; i < v; i++) |
| 36 | { |
| 37 | if (visited[i] == false) |
| 38 | { |
| 39 | topo_sort(vec, visited, i, s); |
| 40 | } |
| 41 | } |
| 42 | |
| 43 | while(s.size() > 0) { |
| 44 | int curr = s.top(); |
| 45 | s.pop(); |
| 46 | cout<<curr << " "; |
| 47 | } |
| 48 | return; |
| 49 | } |
| 50 | |
| 51 | int main() |
| 52 | { |