Something like: https://github.com/mikolalysenko/bipartite-vertex-cover/blob/master/vcover.js I can make a pull request when I'm done.
Activity
EbTech commentedon Jan 14, 2019
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?
EbTech commentedon Jan 14, 2019
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.