%0 Journal Article
%T New algorithm for maximum flow algorithm in network with both node and edge capacity confined<br>点和边有容量约束的网络最大流新算法
%A SHE Xiang-yang
%A LUO Xiao-xia
%A <br>厍向阳
%A 罗晓霞
%J 计算机应用
%D 2008
%I 
%X 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.
%K adjacency matrix
%K maximum flow in network
%K feasible flow
%K confined capacity
%K residual network<br>网络最大流
%K 容量约束
%K 残量网络
%K 可行流
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=EB4BDE2EBA610FF9F2A4FE95DBBAD71F&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=CA4FD0336C81A37A&sid=475189FCB44F11F6&eid=769BD58726D66E7D&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=11