org.jgrapht.alg.matching.blossom.v5

Class KolmogorovMinimumWeightPerfectMatching.DualSolution<V,E>

java.lang.Object

org.jgrapht.alg.matching.blossom.v5.KolmogorovMinimumWeightPerfectMatching.DualSolution<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

Enclosing class:

KolmogorovMinimumWeightPerfectMatching<V,E>

public static class KolmogorovMinimumWeightPerfectMatching.DualSolution<V,E>
extends Object

A solution to the dual linear program formulated on the graph

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method and 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()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, 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