Are there other C++ implementations of minimum cost flow algorithms besides LEMON?
★What algorithm should I use to find the minimum flow on a digraph where there are lower bounds but not upper bounds on flow?