New algorithm for maximum flow algorithm in network with both node and edge capacity confined
点和边有容量约束的网络最大流新算法

Concerning the problems in flow algorithm on network, a new algorithm with strong applicability was studied. The orientation path and residual network were defined, the new maximum flow algorithm in network with both node and edge capacity confined was put forward based on feasible flow decompose theorem and by way of the search in artificial intelligence. In the end, the algorithm was validated and compared by examples. Algorithm testing shows: The new maximum flow algorithm in network with both node and edge capacity confined is completely feasible and availability effective.