Header file to check if a Graph is Biparatite (Bi-colourable)

[THIRU-1074]

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.

https://en.wikipedia.org/wiki/Bipartite_graph

[THIRU-1074]

@ZigRazor please assign this to me !

[ZigRazor]

yes

[THIRU-1074]

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]

it's ok to define in the same header file