KolmogorovWeightedPerfectMatching.DualSolution (JGraphT : a free Java graph library)

java.lang.Object
- org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

Enclosing class:

KolmogorovWeightedPerfectMatching<V,E>
```
public static class KolmogorovWeightedPerfectMatching.DualSolution<V,E>
extends Object
```
A solution to the dual linear program formulated on the graph

Constructor Summary

Constructors
Constructor Description

DualSolution(Graph<V,E> graph, Map<Set<V>,Double> dualVariables)
Constructs a new solution for the dual linear program

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`Map<Set<V>,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()`
`String`	`toString()`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

- Constructor Detail
  - DualSolution
```
public DualSolution(Graph<V,E> graph,
                    Map<Set<V>,Double> dualVariables)
```
    Constructs a new solution for the dual linear program
    
    Parameters:
    
    graph - the graph on which the linear program is formulated
    
    dualVariables - the mapping from sets of vertices of odd cardinality to their dual variables
- Method Detail
  - getGraph
```
public Graph<V,E> getGraph()
```
    Returns:
    
    the graph on which the linear program is formulated
  - getDualVariables
```
public Map<Set<V>,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 String toString()
```
    Overrides:
    
    toString in class Object