title: Bipartite matching in Python
body: <p>Does anybody know any module in Python that computes the best bipartite matching?
  I have tried the following two:
  <OL>
  <LI> <a href="http://pypi.python.org/pypi/munkres/1.0.5.4" rel="nofollow noreferrer">munkres</a> 
  <LI> <a href="http://mit.edu/harold/www/code.html#hungarian" rel="nofollow noreferrer">hungarian</a> 
  </OL>
  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.</p>
  
  <p>Any advice?</p>