Examples of using Maximum flow in English and their translations into Hungarian
{-}
-
Colloquial
-
Official
-
Medicine
-
Ecclesiastic
-
Financial
-
Programming
-
Official/political
-
Computer
Maximum Flow Problems.
Bypass set to maximum flow.
Maximum flow and minimum cut.
Lance rotatable by 175° for maximum flow control.
Theorem: the maximum flow is equal to the minimum cut.
Multi-source multi-sink maximum flow problem.
Similarly, the maximum flow of the Danube has increased: +12% in 165 years.
Permissible t of the pumped liquid and its maximum flow rate.
Centrifugal- provides maximum flow, but create the most noise;
The maximum flow capacity of the mixer and the average water flow in the apartment is.
Anti- flow capability:Maximum flow rate of 1.5m.
Now, it remains to compute a minimum cut in that network(or equivalently a maximum flow).
AFC technology automatically regulates the maximum flow irrespective of the differential pressure.
LEWA EcoPrime chromatography systems are available in a range of designs,whose minimum and maximum flow rates vary.
In this network, the maximum flow is k{\displaystyle k} iff there are k{\displaystyle k} edge-disjoint paths.
Enormous window openings will give space, ensure the maximum flow of fresh air into the room.
Therefore, in the selection, should consider the hydraulicvalve where the loop may pass the maximum flow.
The internal diameter can be chosen by the customer, maximum flow is up to 80 persons per minute;
The maximum flow in a layered graph can be calculated in O(VE) time, and the maximum number of the phases is V-1.
Following the recommendations,exercises to increase testosterone will bring the maximum flow of the male sex hormone.
Transformation of a multi-source multi-sink maximum flow problem into a single-source single-sink maximum flow problem.
Forklift Truck: Normally, the forklift can supply sufficient flow to operate and attachment,please do not attempt to exceed the maximum flow and pressure.
General push-relabel maximum flow algorithm O(V2E) The push relabel algorithm maintains a preflow, i.e. a flow function with the possibility of excess in the vertices.
Dinic's algorithm O(VE log(V))The dynamic trees data structure speeds up the maximum flow computation in the layered graph to O(V E log(V)).
Note that the maximum flow can often be achieved in a number of different ways, and the choice of a different order of paths from source to sink will often lead to a different network solution, but with the same maximum flow.
Bike links and pins have beendesigned to adhere perfectly to gears and sprockets teeth providing maximum flow, reduced friction and improved chain life.
This problem can be transformed to a maximum flow problem by constructing a network N=( V, E){\displaystyle N=(V, E)} from G{\displaystyle G}, with s{\displaystyle s} and t{\displaystyle t} being the source and the sink of N{\displaystyle N} respectively, and assigning each edge a capacity of 1{\displaystyle 1}.
In most applications, the stock turbo has some additional capacity for increased power,but as the compressor reaches the choke limit(maximum flow), the turbo speed increases rapidly, the efficiency drops dramatically, and the compressor discharge temperature ramps up very quickly.
We can transform the multi-source multi-sink problem into a maximum flow problem by adding a consolidated source connecting to each vertex in S{\displaystyle S} and a consolidated sink connected by each vertex in T{\displaystyle T}(also known as supersource and supersink) with infinite capacity on each edge(See Fig. 4.1.1.).
