搜索资源列表
Minimum-cost-maximum-flow-
- 此程序能够解决网络中最小费用最大流问题,内含调试结果及解释。并附有分析流程,结果分析。-This program can solve the minimum cost maximum network flow problem, containing debugging results and interpretation. Together with the analysis process, the results of the analysis.