Successive shortest path minimum cost flow solver
A header only C++ implementation of the successive shortest path algorithm for the minimum cost flow problem. Costs can be either real or integer-valued, while capacities and excesses must be integral.