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>
public static class KolmogorovWeightedPerfectMatching.DualSolution<V,E> extends java.lang.Object
A solution to the dual linear program formulated on thegraph
-
-
Constructor Summary
Constructors Constructor Description DualSolution(Graph<V,E> graph, java.util.Map<java.util.Set<V>,java.lang.Double> dualVariables)
Constructs a new solution for the dual linear program
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.Map<java.util.Set<V>,java.lang.Double>
getDualVariables()
The mapping from sets of vertices of odd cardinality to their dual variables, which represents a solution to the dual linear programGraph<V,E>
getGraph()
java.lang.String
toString()
-
-
-
Constructor Detail
-
DualSolution
public DualSolution(Graph<V,E> graph, java.util.Map<java.util.Set<V>,java.lang.Double> dualVariables)
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 Detail
-
getDualVariables
public java.util.Map<java.util.Set<V>,java.lang.Double> 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
public java.lang.String toString()
- Overrides:
toString
in classjava.lang.Object
-
-