title: How to find if a graph is bipartite?
body: <p>I have been trying to understand the bipartite graph. To my understanding it is a graph G which can be divided into two subgraphs U and V.So that intersection of U and V is a null set and union is graph G.
  I am trying to find if a graph is bipartite or not using BFS. Still it is not clear to me that how can we find this using BFS.</p>
  
  <p>Let us say we have graph defined as below.</p>
  
  <pre><code>a:e,f
  b:e
  c:e,f,h
  d:g,h
  e:a,b,c
  f:a,c,g
  g:f,d
  h:c,d
  </code></pre>
  
  <p>What i need here is step by step explanation of how this graph is a bipartite or not using BFS.</p>