Check for Bipartite Graph

#include<bits/stdc++.h>
bool solve(int start, vector<int> adj[], vector<int> color){
    queue<int> q;
    q.push(start);
    color[start] = 1;
    while(!q.empty()){
        int node = q.front();
        q.pop();
        for(auto it: adj[node]){
            if(color[it] == -1){
                color[it] = !color[node];
                q.push(it);
            }
            else if(color[it] == color[node]){
                return false;
            }
        }
    }
    return true;
}

bool isGraphBirpatite(vector<vector<int>> &edges) {
	int n = edges.size();
    vector<int> adj[n];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(edges[i][j] == 1){
                adj[i].push_back(j);
                adj[j].push_back(i);
            }
        }
    }
    vector<int> color(n, -1);
    for(int i=0;i<n;i++){
        if(color[i] == -1){
            if(!solve(i,adj,color)){
                return false;
            }
        }
    }
    return true;
}