Method isBipartite

IsGraphBipartite.java:20–32

(int[][] graph)

        return true;
    }
    public boolean isBipartite(int[][] graph) {
        int n = graph.length;
        int color[] = new int[n];
        Arrays.fill(color,-1);
        for(int i=0;i<n;i++){
            if(color[i] == -1){
                if(!color(i,graph,color)){
                    return false;
                }
            }
        }
        return true;
    }
}