Uses of Interface com.jgalgo.FlowNetwork (JGAlgo - Parent 0.2.0 API)

Packages that use FlowNetwork
Package Description

com.jgalgo

Uses of FlowNetwork in com.jgalgo

Subinterfaces of FlowNetwork in com.jgalgo
Modifier and Type	Interface	Description
`static interface`	`FlowNetwork.Int`	Flow on graph edges, with integer capacities and flows values.

Methods in com.jgalgo that return FlowNetwork
Modifier and Type	Method	Description
`static FlowNetwork`	FlowNetwork.`createFromEdgeWeights(Graph g)`	Create a flow network by adding edge weights using `Graph.addEdgesWeights(java.lang.Object, java.lang.Class<? super E>)`.
`static FlowNetwork`	FlowNetwork.`createFromEdgeWeights(Weights.Double capacities, Weights.Double flows)`	Create a flow network by using existing edge weights.

Methods in com.jgalgo with parameters of type FlowNetwork
Modifier and Type	Method	Description
`double`	MaximumFlow.`computeMaximumFlow(Graph g, FlowNetwork net, int source, int sink)`	Calculate the maximum flow in a network between a source and a sink.
`double`	MaximumFlow.`computeMaximumFlow(Graph g, FlowNetwork net, IntCollection sources, IntCollection sinks)`	Calculate the maximum flow in a network between a set of sources and a set of sinks.
`void`	MinimumCostFlow.`computeMinCostFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction supply)`	Compute the min-cost (not maximum!) flow in a network given a supply for each vertex.
`void`	MinimumCostFlow.`computeMinCostFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, WeightFunction supply)`	Compute the min-cost (not maximum!) flow in a network given a supply for each vertex and a lower bound for the edges flows.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, int source, int sink)`	Compute the min-cost max-flow in a network between a source and a sink.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, int source, int sink)`	Compute the min-cost max-flow in a network between a source and a sink given a lower bound for the edges flows.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, IntCollection sources, IntCollection 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.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, IntCollection sources, IntCollection sinks)`	Compute the min-cost max-flow in a network between a set of sources and a set of sinks.