Class KolmogorovWeightedPerfectMatching.DualSolution<V,E>

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

  • Field Details

    • graph

      Graph<V,E> graph
      The graph on which both primal and dual linear programs are formulated

    • dualVariables

      Map<Set<V>,Double> dualVariables
      Mapping from sets of vertices of odd cardinality to their dual variables. Represents a solution to the dual linear program

  • Constructor Details

    • 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 Details

    • 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