-
Notifications
You must be signed in to change notification settings - Fork 0
/
bipartite_dfs.cpp
55 lines (50 loc) · 1.09 KB
/
bipartite_dfs.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
private:
bool check(int start,int V, vector<int>adj[],vector<int> &vis,int color){
vis[start]=color;
for(auto it:adj[start]){
if(vis[it]==-1){
//vis[it]=!vis[start];
if(!check(it,V,adj,vis,!vis[start]))return false;
}
else if(vis[it]==vis[start])return false;
}
return true;
}
public:
bool isBipartite(int V, vector<int>adj[]){
vector<int> vis(V,-1);
for(int i=0;i<V;i++){
if(vis[i]==-1){
if(check(i,V,adj,vis,0)==false)return false;
}
}
return true;
}
};
//{ Driver Code Starts.
int main(){
int tc;
cin >> tc;
while(tc--){
int V, E;
cin >> V >> E;
vector<int>adj[V];
for(int i = 0; i < E; i++){
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
Solution obj;
bool ans = obj.isBipartite(V, adj);
if(ans)cout << "1\n";
else cout << "0\n";
}
return 0;
}
// } Driver Code Ends