Uses of Interface
org.graph4j.flow.MaximumFlowAlgorithm

Packages that use MaximumFlowAlgorithm

Package	Description
org.graph4j.flow	Algorithms related to flows in transportation networks.

Uses of MaximumFlowAlgorithm in org.graph4j.flow

Classes in org.graph4j.flow that implement MaximumFlowAlgorithm

Modifier and Type	Class	Description
class	DinicMaximumFlow	/** Implements the Dinic algorithm for finding the maximum flow in a network.
class	EdmondsKarpMaximumFlow	The Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a network.
class	MaximumFlowBase
class	PushRelabelMaximumFlow	The Push-Relabel algorithm maintains a preflow (where flow into a node can exceed flow out of it) and repeatedly pushes excess flow from overflowing vertices to neighboring vertices or relabels the height of the overflowing vertices to find new paths.

Methods in org.graph4j.flow that return MaximumFlowAlgorithm

Modifier and Type	Method	Description
static MaximumFlowAlgorithm	MaximumFlowAlgorithm.getInstance(Network graph)