rahulsonone1234

class Solution {
    bool isbipartite(vector<vector<int>>&adj, int N, int node,vector<int>&color)
    {
        queue<int>q;
        q.push(node);
        color[node]=1;
        while(!q.empty())
        {
            int curr=q.front();
            q.pop();