改进的Ford-Fulkerson算法

Improved Ford-Fulkerson Algorithm

在网络的管理与控制中,需要考虑成本和流量问题,即网络的最小费用和最大流量问题。利用改进Ford-Fu lkerson标号法求得单端和多端的网络最大流,使得通过一次标号得到全部增广链,并同时增流即得最大流。从而在考虑费用最小,最终求得网络最小费用。transportation最后用实例展现了此过程。

In the management and control of network, it is necessary to consider the issue of cost and flux, namely the minimum cost and maximum flux. By improving the labeling method of Ford - Fulkerson to obtain the maximal flow of single - and multi - port network. With the first label, the grand extended chains are found and the maximal flow is obtained. Thus, with the least expenses, the maximal flow of the network is realized.