搜索资源列表
求网络的最小费用最大流-C语言
- 本程序是利用Ford和Fulkerson迭加算法，求最小费用最大流-use of this procedure is superposition Ford and Fulkerson algorithm, the minimum cost for maximum flow
maxflow
- 关于网络流的一些代码，解题报告有最大流，最小费用最大流等-On a number of network flow code, problem-solving report maximum flow, minimum cost maximum flow, etc.
suanfajichu
- 算法基础的报告出要实现了求解网络最大流最小费用的问题-Algorithm based report a problem solving network maximum flow minimum cost
maxflow-with-mincost
- 最小费用最大流 供在学生学习使用，信息学竞赛资料-Minimum cost maximum flow for use in student learning, information science contest
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.
lingo解题
- 一些题目的lingo解答，如目标运输，最小费用最大流，整数规划等(Lingo solutions for some topics, such as target transportation, minimum cost maximum flow, integer programming, etc.)