The algorithm of Ford Fulkerson can not solve all min cut set of network and produce problem in application. 而目前求解网络最小截集的Ford-Fulkerson算法,不能求出网络所有的最小截集,给实际应用带来一定的问题。
This paper advances an algorithm for solving all min cut set of network. 文章提出了一种求网络所有最小截集的算法。
The capacity of the min cut set decides the maximum flow of network. 一个网络的最大流量,是由该网络最小截集的截量决定的。
The arc in min cut set is bottleneck arc of network. 网络最小截集中的弧,是该网络的瓶颈弧。
An Improving Algorithm for Solving Min - cut Set of Network 一种改进的求网络最小截集的算法