Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.

Algorithm to check whether a graph is bipartite More...
#include <iostream>
#include <queue>
#include <vector>
Classes  
class  graph::is_graph_bipartite::Graph 
Class for representing graph as an adjacency list. More...  
Namespaces  
namespace  graph 
Graph Algorithms.  
namespace  is_graph_bipartite 
Functions for checking whether a graph is bipartite or not.  
Functions  
static void  test () 
int  main () 
Algorithm to check whether a graph is bipartite
A graph is a collection of nodes also called vertices and these vertices are connected by edges. A graph is bipartite if its vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V.
The algorithm implemented in this file determines whether the given graph is bipartite or not.
Example  Here is a graph g1 with 5 vertices and is bipartite 1 4 / \ / \ 2 3 5 Example  Here is a graph G2 with 3 vertices and is not bipartite 1  2 \ / 3
int main  (  void  ) 

static 
Function to test the above algorithm
creating graph G1 with 5 vertices
adding edges to the graphs as per the illustrated example
creating graph G2 with 3 vertices
adding edges to the graphs as per the illustrated example
checking whether the graphs are bipartite or not