UVa 10004 - Bicoloring

Link
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=945

Summary
Determine whether a given graph is bicolorable.

Explanation
Bicolorable graphs are equivalent to bipartite graphs, and so the problem boils down to finding whether a given graph is bipartite. For more info on bipartite graphs, see here

ERFANASHORION SOLUTION
you can see this website (http://shipuahamed.blogspot.com/2013/04/uva-10004-bicoloring.html) for implementations.

you can download another implementations on (http://s2.picofile.com/file/7122711070/bfs_good.cpp.html) click on دریافت فایلits persia