C ++ program to find out whether a given graph is Bipartite or not . Using recursion .
#include <iostream> NEW_LINE using namespace std ; #define V  4 NEW_LINE bool colorGraph ( int G [ ] [ V ] , int color [ ] , int pos , int c ) { if ( color [ pos ] != -1 && color [ pos ] != c ) return false ;