说明：  基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 ％ 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 ％ 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 ％ 确定,如此多次迭代,最终得到最小费用最大流.
(Basic ideas: to each arc on the unit cost of traffic as some length, with Floyd for the most short-circuit method to determine the 1 percent since the V1 to Vn the most short-circuit and then this as the most short-circuit the expansion of roads, with maximum flow Solving problems to the flow increased to the greatest possible value of this increased traffic flow on the road as soon as possible after the various units arc flows to re- of the cost, so many times iteration eventually be the minimum cost maximum flow.)