Min-cost and max-flow algorithm of network with both node and edge capacity confined
点和边有容量约束的网络最小费用最大流算法

This paper analyzed the characteristic and type of the min-cost and max-flow algorithm in network, put forward the new min-cost and max-flow algorithm of network with both node and edge capacity confined. It generated the two-objective optimizing model of min-cost and max-flow in network,facing the characteristic of min-cost and max-flow of network with node and edge capacity confined, defined the orientation path and residual network, carried out the new min-cost and max-flow algorithm of network with both node and edge capacity confined, with adjacency matrix to deposit data, being based on feasible flow decompose theorem, by the way of the traversing in data structure. In the end, validated and compared the algorithm by examples. Algorithm testing shows that the new min-cost and max-flow algorithm of network with both node and edge capacity confined is completely feasible and availability.