structural:expansion
Algorithms

The following table lists algorithms for solving the maximum flow problem.Here, V {\displaystyle V} and E {\displaystyle E} denote the number of vertices and edges of the network.The value U {\displaystyle U} refers to the largest edge capacity after rescaling all capacities to integer values(if the network contains irrational capacities, U {\displaystyle U} may be infinite).

For additional algorithms, see Goldberg & Tarjan (1988).