Class 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 java.lang.Object
    A solution to the dual linear program formulated on the graph
    • Field Summary

      Fields 
      Modifier and Type Field Description
      (package private) java.util.Map<java.util.Set<V>,​java.lang.Double> dualVariables
      Mapping from sets of vertices of odd cardinality to their dual variables.
      (package private) Graph<V,​E> graph
      The graph on which both primal and dual linear programs are formulated
    • 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 program
      Graph<V,​E> getGraph()  
      java.lang.String toString()  
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
    • Field Detail

      • graph

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

        java.util.Map<java.util.Set<V>,​java.lang.Double> dualVariables
        Mapping from sets of vertices of odd cardinality to their dual variables. Represents a solution to the dual linear program
    • 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 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 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 class java.lang.Object