Package com.jgalgo.alg.flow

Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.

Interface Summary

Interface	Description
Flow<V,E>	Flow on graph edges.
IFlow	Flow on IntGraph edges.
MaximumFlow	Calculate the maximum flow in a flow network.
MinimumCostFlow	Compute the minimum-cost (max) flow in a flow network.
MinimumCostFlow.Builder	A builder for MinimumCostFlow objects.

Class Summary

Class	Description
MaximumFlowAbstract	Abstract class for computing a maximum flow in a graph.
MaximumFlowAbstractWithoutResidualNet	Abstract class for computing a maximum flow in a graph without using a residual network.
MaximumFlowAbstractWithResidualNet	Abstract class for computing a maximum flow in a graph with a residual network.
MaximumFlowDinic	Dinic's algorithm for maximum flow.
MaximumFlowDinicDynamicTrees	Dinic's algorithm for maximum flow using dynamic trees.
MaximumFlowEdmondsKarp	The Edmonds-Karp algorithm for maximum flow.
MaximumFlowPushRelabel	The push-relabel maximum flow algorithm with FIFO ordering.
MaximumFlowPushRelabelDynamicTrees	The push relabel algorithm for maximum flow using dynamic trees.
MinimumCostFlowAbstract	Abstract class for computing minimum cost flow in a graph.
MinimumCostFlowAbstractBasedSourceSink	Abstract class for computing a minimum cost flow in a graph, based on a source-sink solution.
MinimumCostFlowAbstractBasedSupply	Abstract class for computing a minimum cost flow in a graph, based on a supply solution.
MinimumCostFlowCostScaling	Minimum-cost flow computation using the cost-scaling algorithm with partial-augmentations push-relabel variant.
MinimumCostFlowCycleCanceling	Compute the minimum-cost (max) flow in a flow network using cycle canceling.