Uses of Class
com.jgalgo.alg.flow.MaximumFlowPushRelabel
Packages that use MaximumFlowPushRelabel
Package
Description
Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.
-
Uses of MaximumFlowPushRelabel in com.jgalgo.alg.flow
Methods in com.jgalgo.alg.flow that return MaximumFlowPushRelabelModifier and TypeMethodDescriptionstatic MaximumFlowPushRelabelMaximumFlowPushRelabel.newInstanceFifo()Create a new push-relabel maximum flow algorithm object with a FIFO heuristic.static MaximumFlowPushRelabelMaximumFlowPushRelabel.newInstanceHighestFirst()Create a new push-relabel maximum flow algorithm object with a highest first heuristic.static MaximumFlowPushRelabelMaximumFlowPushRelabel.newInstanceLowestFirst()Create a new push-relabel maximum flow algorithm object with a lowest first heuristic.static MaximumFlowPushRelabelMaximumFlowPushRelabel.newInstanceMoveToFront()Create a new push-relabel maximum flow algorithm object with a move-to-front heuristic.static MaximumFlowPushRelabelMaximumFlowPushRelabel.newInstancePartialAugment()Create a new push-relabel maximum flow algorithm object with a partial augment discharge policy and highest first active heuristic.