Module org.jgrapht.core
Class KolmogorovWeightedPerfectMatching.DualSolution<V,E>
java.lang.Object
org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution<V,E>
- Type Parameters:
V
- the graph vertex typeE
- the graph edge type
- Enclosing class:
- KolmogorovWeightedPerfectMatching<V,
E>
A solution to the dual linear program formulated on the
graph
-
Constructor Summary
-
Method Summary
-
Constructor Details
-
DualSolution
Constructs a new solution for the dual linear program- Parameters:
graph
- the graph on which the linear program is formulateddualVariables
- the mapping from sets of vertices of odd cardinality to their dual variables
-
-
Method Details
-
getGraph
- Returns:
- the graph on which the linear program is formulated
-
getDualVariables
The mapping from sets of vertices of odd cardinality to their dual variables, which represents a solution to the dual linear program- Returns:
- the mapping from sets of vertices of odd cardinality to their dual variables
-
toString
-