Uses of Interface
com.jgalgo.alg.flow.Flow

Packages that use Flow

Package	Description
com.jgalgo.alg.flow	Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.

Uses of Flow in com.jgalgo.alg.flow

Subinterfaces of Flow in com.jgalgo.alg.flow

Modifier and Type	Interface	Description
interface	IFlow	Flow on IntGraph edges.

Methods in com.jgalgo.alg.flow that return Flow

Modifier and Type	Method	Description
<V,E> Flow<V,E>	MaximumFlow.computeMaximumFlow(Graph<V,E> g, WeightFunction<E> capacity, Collection<V> sources, Collection<V> sinks)	Calculate the maximum flow in a network between a set of sources and a set of sinks.
<V,E> Flow<V,E>	MaximumFlow.computeMaximumFlow(Graph<V,E> g, WeightFunction<E> capacity, V source, V sink)	Calculate the maximum flow in a network between a source and a sink.
<V,E> Flow<V,E>	MaximumFlowAbstract.computeMaximumFlow(Graph<V,E> g, WeightFunction<E> capacity, Collection<V> sources, Collection<V> sinks)
<V,E> Flow<V,E>	MaximumFlowAbstract.computeMaximumFlow(Graph<V,E> g, WeightFunction<E> capacity, V source, V sink)
<V,E> Flow<V,E>	MinimumCostFlow.computeMinCostFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<E> lowerBound, WeightFunction<V> supply)	Compute the min-cost (not maximum!)
<V,E> Flow<V,E>	MinimumCostFlow.computeMinCostFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<V> supply)	Compute the min-cost (not maximum!)
<V,E> Flow<V,E>	MinimumCostFlowAbstract.computeMinCostFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<E> lowerBound, WeightFunction<V> supply)
<V,E> Flow<V,E>	MinimumCostFlowAbstract.computeMinCostFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<V> supply)
<V,E> Flow<V,E>	MinimumCostFlow.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<E> lowerBound, Collection<V> sources, Collection<V> sinks)	Compute the min-cost max-flow in a network between a set of sources and a set of sinks given a lower bound for the edges flows.
<V,E> Flow<V,E>	MinimumCostFlow.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<E> lowerBound, V source, V sink)	Compute the min-cost max-flow in a network between a source and a sink given a lower bound for the edges flows.
<V,E> Flow<V,E>	MinimumCostFlow.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, Collection<V> sources, Collection<V> sinks)	Compute the min-cost max-flow in a network between a set of sources and a set of sinks.
<V,E> Flow<V,E>	MinimumCostFlow.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, V source, V sink)	Compute the min-cost max-flow in a network between a source and a sink.
<V,E> Flow<V,E>	MinimumCostFlowAbstract.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<E> lowerBound, Collection<V> sources, Collection<V> sinks)
<V,E> Flow<V,E>	MinimumCostFlowAbstract.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, WeightFunction<E> lowerBound, V source, V sink)
<V,E> Flow<V,E>	MinimumCostFlowAbstract.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, Collection<V> sources, Collection<V> sinks)
<V,E> Flow<V,E>	MinimumCostFlowAbstract.computeMinCostMaxFlow(Graph<V,E> g, WeightFunction<E> capacity, WeightFunction<E> cost, V source, V sink)