Maxflow is a collection of various algorithms for finding the maximum flow in a network, including some parallel solvers.

A C++17 compliant compiler is needed to build Maxflow.

mkdir build && cd build
cmake .. && make
cd ..

The maxflow binary reads a max flow problem in the DIMACS format and solves it using the specified algorithm. The Edmonds–Karp algorithm is used in the example below.

./maxflow ek -f example.inp

For the list of possible algorithms and other options, use:

./maxflow --help