title: Fast max-flow min-cut library for Python
body: <p>Is there a reliable and well-documented Python library with a <em>fast</em> implementation of an algorithm that finds maximum flows and minimum cuts in directed graphs?</p>
  
  <p><a href="http://www.linux.ime.usp.br/~matiello/python-graph/docs/pygraph.algorithms.minmax-module.html#maximum_flow" rel="noreferrer">pygraph.algorithms.minmax.maximum_flow</a> from <a href="http://code.google.com/p/python-graph/" rel="noreferrer">python-graph</a> solves the problem but it is painfully slow: finding max-flows and min-cuts in a directed graph with something like 4000 nodes and 11000 edges takes > 1 minute. I am looking for something that is at least an order of magnitude faster.</p>
  
  <p><strong>Bounty</strong>: I'm offering a bounty on this question to see if the situation has changed since when this question was asked. Bonus points if you have personal experience with the library you recommend!</p>