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 …?