Repository navigation
Header file to check if a Graph is Biparatite (Bi-colourable) #464
Description
A graph is bipartite if the nodes can be partitioned into two independent sets A and B such that every edge in the graph connects a node in Set A and a node in Set B.
Activity
THIRU-1074 commentedon Aug 29, 2024
@ZigRazor please assign this to me !
ZigRazor commentedon Aug 29, 2024
yes
THIRU-1074 commentedon Aug 31, 2024
To implement this I need to check for odd nodes cycles in the graph therefore I have made another logic for the detecting those type of cycles. I can't include and use available cycle detection headers for this algorithm is that fine ? Should I make separate header for detecting even or odd nodes cycle and include in bipartite or shall I define in the same header itself.
ZigRazor commentedon Sep 2, 2024
it's ok to define in the same header file
yuvam2005 commentedon Oct 11, 2025
Hi @ZigRazor is the issue still open?
If yes, can you please assign me
I would love contributing
ZigRazor commentedon Oct 13, 2025
yes, I assign it to you!