Method and device for selecting optimal network maximum flow algorithm

Abstract

Embodiments of the present invention provide a method and a device for selecting optimal network maximum flow algorithm, and relates to the field of network maximum flows, which can determine an optimal network maximum flow algorithm according to different network flow graphs. The method comprises: an algorithm selecting device acquiring a network flow graph, and obtaining a first residual network according to the network flow graph; acquiring an operation algorithm set, the operation algorithm set comprising at least two algorithms; performing preflow push concurrently in the first residual network by using at least two algorithms, to obtain a second residual network, determining, in the second residual network, a quantity of pivotal edges corresponding to the at least two algorithms, and determining that an algorithm corresponding to the maximum value of the quantity of pivotal edges, as an optimal network maximum flow algorithm of the network flow graph. The embodiments of the present invention are used for selecting a network maximum flow algorithm.

Description

technical field [0001] The invention relates to the field of network maximum flow, in particular to a method and equipment for selecting an optimal network maximum flow algorithm. Background technique [0002] The problem of obtaining the maximum flow in a network is a classic problem in graph theory and combinatorial optimization, and it has a wide range of application backgrounds. [0003] In the prior art, the pre-flow promotion method is a commonly used method for obtaining the maximum flow of the network. The method includes a variety of algorithms, and these algorithms can be summarized as follows: obtain the residual network according to the obtained network flow graph, and obtain the residual network from the Obtain the active node, and advance the surplus flow corresponding to the active node to the sink point through the adjacent node in the residual network, and after determining that the adjacent node is a new active node, continue to The residual network advanc...

AI Technical Summary

Problems solved by technology

[0004] It can be seen from the above that in the existing process of obtaining the maximum network flow through the pre-flow pushing method, only one algorithm is used to pre-flow the network flow graph, that is, no matter what type of network flow graph is obtained ( For example, it can be an unbalanced bipartite graph), all of which are calculated by an algorithm, but for different types of network flow gr...

Images