| 11 | } |
| 12 | |
| 13 | void dfs(vector<int> vec[], int source, vector<bool> &visited) |
| 14 | { |
| 15 | visited[source] = true; |
| 16 | cout << source << " "; |
| 17 | for (int i = 0; i < vec[source].size(); i++) |
| 18 | { |
| 19 | int adjacent = vec[source][i]; |
| 20 | if (visited[adjacent] == false) |
| 21 | { |
| 22 | dfs(vec, adjacent, visited); |
| 23 | } |
| 24 | } |
| 25 | } |
| 26 | |
| 27 | void dfs_rec(vector<int> vec[], int v) |
| 28 | { |