MaximumFlowDinicDynamicTrees (JGAlgo - Parent 0.5.1-SNAPSHOT API)

java.lang.Object
- com.jgalgo.alg.connect.MinimumEdgeCutStAbstract
- - com.jgalgo.alg.flow.MaximumFlowAbstract
  - - com.jgalgo.alg.flow.MaximumFlowAbstractWithResidualNet
    - - com.jgalgo.alg.flow.MaximumFlowDinicDynamicTrees

All Implemented Interfaces:

MinimumEdgeCutSt, MaximumFlow
```
public class MaximumFlowDinicDynamicTrees
extends MaximumFlowAbstractWithResidualNet
```
Dinic's algorithm for maximum flow using dynamic trees.
Using dynamic trees, the algorithm of Dinic to maximum flow problem is implemented in time \(O(m n \log n)\) and linear space. In practice, the (relative) complicated implementation of dynamic trees have little gain in the overall performance, and its probably better to use some variant of the MaximumFlowPushRelabel, which has worse theoretically bounds, but runs faster in practice.

Author:

Barak Ugav

See Also:

MaximumFlowDinic

- Constructor Summary
  
  Constructors
  Constructor Description
  
  MaximumFlowDinicDynamicTrees()
  Create a new maximum flow algorithm object.
- Method Summary
  - Methods inherited from class com.jgalgo.alg.flow.MaximumFlowAbstract
    computeMaximumFlow, computeMaximumFlow
  - Methods inherited from class com.jgalgo.alg.connect.MinimumEdgeCutStAbstract
    computeMinimumCut, computeMinimumCut
  - Methods inherited from class java.lang.Object
    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - MaximumFlowDinicDynamicTrees
```
public MaximumFlowDinicDynamicTrees()
```
    Create a new maximum flow algorithm object.
    Please prefer using MaximumFlow.newInstance() to get a default implementation for the MaximumFlow interface.