Class MaximumFlowAbstractWithResidualNet
java.lang.Object
com.jgalgo.alg.connect.MinimumEdgeCutStAbstract
com.jgalgo.alg.flow.MaximumFlowAbstract
com.jgalgo.alg.flow.MaximumFlowAbstractWithResidualNet
- All Implemented Interfaces:
MinimumEdgeCutSt,MaximumFlow
- Direct Known Subclasses:
MaximumFlowDinic,MaximumFlowDinicDynamicTrees,MaximumFlowPushRelabelDynamicTrees
Abstract class for computing a maximum flow in a graph with a residual network.
- Author:
- Barak Ugav
-
Constructor Summary
Constructors -
Method Summary
Methods inherited from class com.jgalgo.alg.flow.MaximumFlowAbstract
computeMaximumFlow, computeMaximumFlowMethods inherited from class com.jgalgo.alg.connect.MinimumEdgeCutStAbstract
computeMinimumCut, computeMinimumCut
-
Constructor Details
-
MaximumFlowAbstractWithResidualNet
public MaximumFlowAbstractWithResidualNet()Default constructor.
-