How to find if a graph is bipartite?

Question

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

Answer 1

Do it more simpler way.

Run the strongly connected component algorithm.

If any node of metagraph obtained has more than two vertices then the given graph is not bipartite.