Class CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl<V,​E>

    • Constructor Summary

      Constructors 
      Constructor Description
      CapacitatedSpanningTreeImpl​(java.util.Map<V,​java.lang.Integer> labels, java.util.Map<java.lang.Integer,​Pair<java.util.Set<V>,​java.lang.Double>> partition, java.util.Set<E> edges, double weight)
      Construct a new capacitated spanning tree.
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      java.util.Set<E> getEdges()
      Set of edges of the spanning tree.
      java.util.Map<V,​java.lang.Integer> getLabels()
      Return the set of labels of the underlying partition of the capacitated spanning tree.
      java.util.Map<java.lang.Integer,​Pair<java.util.Set<V>,​java.lang.Double>> getPartition()
      Return the label-to-partition map of the underlying partition of capacitated spanning tree.
      double getWeight()
      Returns the weight of the spanning tree.
      boolean isCapacitatedSpanningTree​(Graph<V,​E> graph, V root, double capacity, java.util.Map<V,​java.lang.Double> demands)
      Tests whether cmst is a CMST on graph with root root, capacity capacity and demand function demands.
      java.lang.String toString()  
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
      • Methods inherited from interface java.lang.Iterable

        forEach, spliterator
    • Constructor Detail

      • CapacitatedSpanningTreeImpl

        public CapacitatedSpanningTreeImpl​(java.util.Map<V,​java.lang.Integer> labels,
                                           java.util.Map<java.lang.Integer,​Pair<java.util.Set<V>,​java.lang.Double>> partition,
                                           java.util.Set<E> edges,
                                           double weight)
        Construct a new capacitated spanning tree.
        Parameters:
        labels - the labelling of the vertices marking their subset membership in the partition
        partition - the implicitly defined partition of the vertices in the capacitated spanning tree
        edges - the edge set of the capacitated spanning tree
        weight - the weight of the capacitated spanning tree, i.e. the sum of all edge weights