OJ Board

thanks a lot for your help
it was very useful

Checking if a graph is bipartite is basically checking if a graph can be 2-colored.

This can be done with DFS in linear time.

thanks
But can you explain me a little more please?
I am not sure how to do it in linear time

HI!
My first problem is to know if a graph is bipartite in the fastest way.
I don't know any algorithm in particular to do it...and I think I can do it in the best way in O(n), or I hope so, but if someone knows a method or a good algorithm it would be nice to know it.
The second problem is this ...