Conformation of Bipartite graph

I was reading an article for checking given graph is bipartite or not…

On stackoverflow, it says that

If a graph is not connected, it may have more than one bipartition. You need to check all those components separately with the algorithm as mentioned above.

So , what exactly does that means…??
If a graph has 2 components then should i create complement graph for both components seperately and then then run bfs on each of them …?

Probably your question should be answered once the September challenge is over.
This directly refers to one of the questions and hence discussion on this topic must be avoided.

Refer to Codechef Code of conduct rules

1 Like

@d_skyhawk… it can be general doubt too , as i just mentioned the algorithm and didn’t mention any question problem to this algorithm.