how to check bipartiteness for a directed graph?is it same as checking for an undirected graph or there will be some difference in the implementation?if there is a difference what is it?
Bipartite for a directed graph
@Rj.25 yes it will still work for an directed graph (BFS/DFS will still yield correct answer!), but you have to convert this directed graph into undirected one!!(just add backedge, or if there is an edge from u->v, then add edge v->u if it already doesnot exists!)
This is required as it will make your result source independent!
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.