Fast Python min-cut library with BSD license

StackOverflow https://stackoverflow.com/questions/10813990

Question

Is there a fast cython/python library for doing maximum flow / minimum cut computations (preferably with Boykov-Kolmogorov) that has a BSD license?

A light-weight C library would also be useful.

Was it helpful?

Solution

As detailed in this answer which also includes a simple benchmark, SciPy -- which is licensed under BSD-3 -- includes an implementation as of 1.4.0 as scipy.sparse.csgraph.maximum_flow.

OTHER TIPS

There is Graph-Tool which is GPL licensed or Python-Graph which is MIT licensed, depending on what you can live with.

How about NetworkX? Check out their flow-related algorithms.

The license is BSD

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top