The famous max-flow min-cut theorem determines the maximum throughput of a network.
最大流最小割定理决定了网络的最大吞吐量。
2
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.