rust-algorithms
rust-algorithms copied to clipboard
Add bipartite vertex cover alongside dinic
Something like: https://github.com/mikolalysenko/bipartite-vertex-cover/blob/master/vcover.js
I can make a pull request when I'm done.
That would be sweet. I forget: is the vertex cover possible to construct from the output of Dinic/Hopcroft-Karp, or does it need a separate algorithm?
I suppose the vertex set in question is K from https://en.wikipedia.org/wiki/K%C5%91nig%27s_theorem_(graph_theory)#Proof
Edit: Looks like the example you linked does something similar, I see.