Bi-partitle matching in Python
- by vailen
Does anybody know any module in Python that computes the best bi-partite matching?
I have tried the following two:
munkres
hungarian
However, in my case, I have to deal with non-complete graph (i.e., there might not be an edge between two nodes), and therefore, there might not be a match if the node has no edge. The above two packages seem not be able to deal with this.
Any advise?