最小费用最大流问题,是用C实现的，比较高效率-Minimum cost maximum flow problem is to use C to achieve relatively high efficiency

关于图论中最小费用最大流的PPT介绍，解释很详尽，对于本题目的算法很有帮助-Graph theory about the minimum cost maximum flow PPT introduction, the explanation is very detailed, for ontology purpose algorithm is very helpful

C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash metho

完全二分图算法（KM算法）的网络流算法实现，利用最小费用最大网络流算法-Complete bipartite graph algorithms (KM algorithm) network flow algorithm, using the minimum cost maximum network flow algorithm