V - the graph vertex typeE - the graph edge typepublic static class KolmogorovWeightedPerfectMatching.DualSolution<V,E>
extends java.lang.Object
graph| Constructor and 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
|
| Modifier and Type | Method and 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 program
|
Graph<V,E> |
getGraph() |
java.lang.String |
toString() |
public DualSolution(Graph<V,E> graph, java.util.Map<java.util.Set<V>,java.lang.Double> dualVariables)
graph - the graph on which the linear program is formulateddualVariables - the mapping from sets of vertices of odd cardinality to their dual
variablespublic java.util.Map<java.util.Set<V>,java.lang.Double> getDualVariables()
public java.lang.String toString()
toString in class java.lang.ObjectCopyright © 2019. All Rights Reserved.