Uses of Interface
org.jgrapht.alg.interfaces.MaximumFlowAlgorithm
Packages that use MaximumFlowAlgorithm
Package
Description
Algorithms dealing with various connectivity aspects of a graph.
Flow related algorithms.
-
Uses of MaximumFlowAlgorithm in org.jgrapht.alg.connectivity
Constructor parameters in org.jgrapht.alg.connectivity with type arguments of type MaximumFlowAlgorithmModifierConstructorDescriptionKConnectivityFlowAlgorithm(Graph<V, E> graph, Function<Graph<V, E>, MaximumFlowAlgorithm<V, E>> edgeFlowAlgorithmSupplier, Function<Graph<Integer, DefaultEdge>, MaximumFlowAlgorithm<Integer, DefaultEdge>> vertexFlowAlgorithmSupplier) Constructs a k-connectivity algorithm for the given graph. -
Uses of MaximumFlowAlgorithm in org.jgrapht.alg.flow
Classes in org.jgrapht.alg.flow that implement MaximumFlowAlgorithmModifier and TypeClassDescriptionclassThis is an implementation of the Boykov-Kolmogorov maximum flow algorithm.classDinicMFImpl<V,E> Implementation of <a href = "https://en.wikipedia.org/wiki/Dinic%27s_algorithm">Dinic algorithm</a> with scaling for <a href = "https://en.wikipedia.org/wiki/Maximum_flow_problem"maximum"maximum flow problem</a>.final classEdmondsKarpMFImpl<V,E> This class computes a maximum flow in a flow network using Edmonds-Karp algorithm.classThis class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield.classThis class computes a Gomory-Hu tree (GHT) using the algorithm proposed by Dan Gusfield.classBase class backing algorithms allowing to derive maximum-flow from the supplied flow networkclassPushRelabelMFImpl<V,E> Push-relabel maximum flow algorithm designed by Andrew V.