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

许多系统包含了流量问题。例如交通系统有车流量，金融系统有现金流，控制系统有信息流等。许多流问题主要是确定这类系统网络所能承受的最大流量以及如何达到这个最大流量。MATLAB环境下解决最大流问题-Many systems contain a flow problem. Traffic such as traffic system, the financial system has cash flow, information flow control system. Many flow probl