| 13 | } |
| 14 | |
| 15 | void topo_sort(vector<int> vec[], vector<bool> &visited, int source, stack<int> &s) |
| 16 | { |
| 17 | cout<<"source: "<<source<<endl; |
| 18 | visited[source] = true; |
| 19 | for (int i = 0; i < vec[source].size(); i++) |
| 20 | { |
| 21 | int adjacent = vec[source][i]; |
| 22 | if (visited[adjacent] == false) |
| 23 | { |
| 24 | topo_sort(vec, visited, adjacent, s); |
| 25 | } |
| 26 | } |
| 27 | s.push(source); |
| 28 | return; |
| 29 | } |
| 30 | |
| 31 | void topo_rec(vector<int> vec[], int v) |
| 32 | { |