| 42 | } |
| 43 | |
| 44 | void find_transpose(vector<int> vec[], int v, vector<int> transpose[]) |
| 45 | { |
| 46 | for (int i = 0; i < v; i++) |
| 47 | { |
| 48 | for (int j = 0; j < vec[i].size(); j++) |
| 49 | { |
| 50 | int first = i; |
| 51 | int second = vec[i][j]; |
| 52 | add_edge(transpose, second, first); |
| 53 | } |
| 54 | } |
| 55 | } |
| 56 | |
| 57 | void dfs(vector<int> transpose[], int source, vector<bool> &visited) |
| 58 | { |