Code to check if graph is bipartite

[anishsofat]

No description provided.

[Biswajitghosh98]

Isn't it the same as #23 ? @anishsofat

[anishsofat]

I think you had allotted bipartite graph in 2 different issues. I didn't know that anyone else was working on it. @Biswajitghosh98

[anishsofat]

#7 and #9 both have bipartite. @Biswajitghosh98

[Biswajitghosh98]

@anishsofat I'm so sorry, that was a mistake from our end.
However, let's not let it go to waste. Convert the PR into a draft PR and refactor it into maximum bipartite matching.
The problem statement would then be converted to :
We are given a bipartite graph, output a subset of nodes and edges which return the maximum 1 to 1 matching.

[anishsofat]

Great. Working on it. @Biswajitghosh98

[Biswajitghosh98]

@anishsofat On a side note, there are specific algorithms you might want to have a look at, rather then brute force.

[yashrsharma44]

Hi @anishsofat , any updates?

[anishsofat]

Hi, @yashrsharma44. I will try to submit it by tomorrow.