| 30 | } |
| 31 | |
| 32 | bool cycleDFS(int node, int parent, vector<int> &vis, vector<int> arr[]) |
| 33 | { |
| 34 | vis[node] = 1; |
| 35 | for (auto i : arr[node]) |
| 36 | { |
| 37 | if (!vis[i]) |
| 38 | { |
| 39 | if (cycleDFS(i, node, vis, arr)) |
| 40 | return true; |
| 41 | } |
| 42 | else |
| 43 | { |
| 44 | if (i != parent) |
| 45 | return true; |
| 46 | } |
| 47 | } |
| 48 | |
| 49 | return false; |
| 50 | } |
| 51 | |
| 52 | void bfs(int node, vector<int> &vis, vector<int> arr[], vector<int> &ans) |
| 53 | { |