Class MaximumFlowProblem.MaximumFlowProblemImpl<V,E>
java.lang.Object
org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl<V,E>
- Type Parameters:
V- the graph vertex typeE- the graph edge type
- All Implemented Interfaces:
MaximumFlowProblem<V,E>
- Enclosing interface:
MaximumFlowProblem<V,E>
public static class MaximumFlowProblem.MaximumFlowProblemImpl<V,E>
extends Object
implements MaximumFlowProblem<V,E>
Default implementation of a Maximum Flow Problem.
- Author:
- Timofey Chudakov
-
Nested Class Summary
Nested classes/interfaces inherited from interface MaximumFlowProblem
MaximumFlowProblem.MaximumFlowProblemImpl<V,E> -
Field Summary
Fields inherited from interface MaximumFlowProblem
CAPACITY_INF -
Constructor Summary
Constructors -
Method Summary
Methods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface MaximumFlowProblem
dumpCapacities, getSink, getSource, isSingleSourceSingleSinkProblem
-
Constructor Details
-
MaximumFlowProblemImpl
-
-
Method Details
-
getGraph
-
getSources
Returns the source set of this problem.- Specified by:
getSourcesin interfaceMaximumFlowProblem<V,E> - Returns:
- the source set of this problem.
-
getSinks
-
getCapacities
Returns the capacity function of this problem. This function is defined for all edges of the underlying network.- Specified by:
getCapacitiesin interfaceMaximumFlowProblem<V,E> - Returns:
- the capacity function of this problem.
-
toSingleSourceSingleSinkProblem
Converts this problem to the canonical form. Resulting problem is equivalent to the previous one.- Specified by:
toSingleSourceSingleSinkProblemin interfaceMaximumFlowProblem<V,E> - Returns:
- a problem in the canonical form.
-