Bipartite matching in Python

Posted by vailen on Stack Overflow See other posts from Stack Overflow or by vailen
Published on 2010-04-23T17:59:30Z Indexed on 2010/04/23 18:23 UTC
Read the original article Hit count: 214

Filed under:
|
|

Does anybody know any module in Python that computes the best bipartite matching? I have tried the following two:

  1. munkres
  2. 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 to be able to deal with this.

Any advice?

© Stack Overflow or respective owner

Related posts about python

Related posts about bipartite