Input: N = 5
Below is the given graph with number of nodes is 5:
Possible groups satisfying the Bipartite property: [2, 5], [1, 3], 
Below is the number of bipartite groups can be formed:
The idea is to find the maximum height of all the Connected Components in the given graph of N nodes to find the minimum bipartite groups. Below are the steps:
- For all the non-visited vertex in the given graph, find the height of the current Connected Components starting from the current vertex.
- Start DFS Traversal to find the height of all the Connected Components.
- The maximum of the heights calculated for all the Connected Components gives the minimum bipartite groups required.
Below is the implementation of the above approach:
Time Complexity: O(V+E), where V is the number of vertices and E is the set of edges.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.