On this basis, in order to minimize the two objectives of the transport costs to model, to convert it into a network flow model with a stratified, with the minimum cost maximum flow algorithm.
在此基础上以运输成本最小化为二级目标建立模型，将其转化成带有分层的网络流模型，用最小费用最大流算法进行求解。
To begin with, this paper analyzed and compared kinds of methods solving the network maximum flow problem.
本文首先对现有求解网络最大流的各种算法进行了分析和比较。
If an edge in a network is destroyed, the value of maximum flow between two vertices in the network is decreased in general.
如果网络中的一条边被破坏，网络中任意两个顶点之间的最大流一般要减少。
The saturated flow of blocking network is less than the maximum flow.
网络发生堵塞时的饱和流值达不到最大流值。
The famous max-flow min-cut theorem determines the maximum throughput of a network.
最大流最小割定理决定了网络的最大吞吐量。
It is a trivial work to test whether a network is a small capacity network, so the algorithm of this paper is also useful for general maximum flow problems.
同时，由于判断一个网络是否为小容量网络非常简单，因此该算法也具有普遍意义。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the application of algorithm in the network of road.
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
If the decrease of the value of maximum flow by the destruction is large, the degree of influence of the edge on the vulnerability of the network is considered to be large.
若某条边被破坏后使最大流减少，可以说它对网络脆弱性的影响较大。
If the decrease of the value of maximum flow by the destruction is large, the degree of influence of the edge on the vulnerability of the network is considered to be large.
若某条边被破坏后使最大流减少，可以说它对网络脆弱性的影响较大。
应用推荐