If an edge in a network is destroyed, the value of maximum flow between two vertices in the network is decreased in general.
如果网络中的一条边被破坏，网络中任意两个顶点之间的最大流一般要减少。
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.
在此基础上以运输成本最小化为二级目标建立模型，将其转化成带有分层的网络流模型，用最小费用最大流算法进行求解。
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.
若某条边被破坏后使最大流减少，可以说它对网络脆弱性的影响较大。
应用推荐