最大流最小割定理决定了网络的最大吞吐量。
The famous max-flow min-cut theorem determines the maximum throughput of a network.
网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.
由于后者的实用性更强，人们对它投入的关注与研究也更多，因而实际中是通过最大流问题来求最小割集问题。
People pay mo re attention to and plunge more research into the latter because of its more practical use, and thus always solve the minimum cut problem by means of the maxim um flow algorithm.
由于后者的实用性更强，人们对它投入的关注与研究也更多，因而实际中是通过最大流问题来求最小割集问题。
People pay mo re attention to and plunge more research into the latter because of its more practical use, and thus always solve the minimum cut problem by means of the maxim um flow algorithm.
应用推荐