| 71 | } |
| 72 | |
| 73 | void dfs(int node, vector<int> &vis, vector<int> arr[], vector<int> &ans) |
| 74 | { |
| 75 | vis[node] = 1; |
| 76 | ans.push_back(node); |
| 77 | for (auto i : arr[node]) |
| 78 | { |
| 79 | if (!vis[i]) |
| 80 | { |
| 81 | vis[i] = 1; |
| 82 | dfs(i, vis, arr, ans); |
| 83 | } |
| 84 | } |
| 85 | } |
| 86 | |
| 87 | bool bipertiteBFS(int n, vector<int> &color, vector<int> arr[]) |
| 88 | { |