{"library":"pylmcf","type":"library","category":null,"description":"Python bindings for the Network Simplex algorithm from the LEMON library, providing minimum cost flow (MCF) solvers for directed graphs. Version 0.9.13, mature but stable with infrequent releases.","language":"python","status":"active","version":"0.9.13","tags":["minimum-cost-flow","network-simplex","lemon","graph-optimization"],"install":[{"cmd":"pip install pylmcf","imports":["from pylmcf import Graph","from pylmcf import graph","from pylmcf import pylmcf_cpp"]}],"homepage":"https://github.com/michalsta/pylmcf.git","github":"https://github.com/michalsta/pylmcf.git","docs":null,"changelog":null,"pypi":null,"npm":null,"openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null,"provenance":{"verified_status":"passing","verified_at":"Fri Jul 03","last_verified":"Fri Jul 03","next_check":"Sun Aug 02","install_tag":null}}