Bipartite Graph using BFS in C++

Link for the question : https://practice.geeksforgeeks.org/problems/bipartite-graph/1#

Soltion / Code : refer to striver video, for understanding part too !

class Solution {
public:
    bool bipartite_bfs(int src, vector<int>adj[], int color[])
    {
        queue<int>q;
        q.push(src);
        color[src]=1;
        
        while(!q.empty())
        {
            int node = q.front();
            q.pop();
            
            for(auto it:adj[node])
            {
                if(color[it]==-1)
                {
                    color[it] = 1-color[node];
                    q.push(it);
                }
                else if(color[it]==color[node])
                return false;
            }
        }
        return true;
    }

public:
	bool isBipartite(int V, vector<int>adj[]){
	    // Code here
	 int color[V];
	 memset(color,-1,sizeof color);
	 for(int i=0;i<V;i++)
	 {
	     if(color[i]==-1)
	     {
	         if(!bipartite_bfs(i,adj,color))
	         return false;
	     }
	 }
	 return true;
	}
};