| 28 | } |
| 29 | |
| 30 | void topo_sort(vector<int> vec[], int source, vector<bool> &visited, stack<int> &st) |
| 31 | { |
| 32 | visited[source] = true; |
| 33 | for (int i = 0; i < vec[source].size(); i++) |
| 34 | { |
| 35 | int adjacent = vec[source][i]; |
| 36 | if (visited[adjacent] == false) |
| 37 | { |
| 38 | topo_sort(vec, adjacent, visited, st); |
| 39 | } |
| 40 | } |
| 41 | st.push(source); |
| 42 | } |
| 43 | |
| 44 | void find_transpose(vector<int> vec[], int v, vector<int> transpose[]) |
| 45 | { |