mcmf (cargo): This crate is for solving instances of the minimum cost maximum flow problem. It uses the network simplex algorithm from the LEMON graph optimization library.
Keywords: optimization|graph|flow|rust