最大流最小割算法的VC++实现，用于得出网络原点到终点之间的最大流量限制。-The minimum cut VC++ flow of the algorithm is realized that network origin to finish between the peak flow restrictions.

最大流Edmonds-karp算法代码源，应用最短路径方法，相对于Ford算法简单-Edmonds- karp maximum flow algorithm source code, using the shortest path method, relative to the Ford algorithm is simple