Uses of Interface
org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree
-
Packages that use SpanningTreeAlgorithm.SpanningTree Package Description org.jgrapht.alg.interfaces Algorithm related interfaces.org.jgrapht.alg.spanning Spanning tree and spanner algorithms. -
-
Uses of SpanningTreeAlgorithm.SpanningTree in org.jgrapht.alg.interfaces
Subinterfaces of SpanningTreeAlgorithm.SpanningTree in org.jgrapht.alg.interfaces Modifier and Type Interface Description static interface
CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E>
A spanning tree.Classes in org.jgrapht.alg.interfaces that implement SpanningTreeAlgorithm.SpanningTree Modifier and Type Class Description static class
CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl<V,E>
Default implementation of the spanning tree interface.static class
SpanningTreeAlgorithm.SpanningTreeImpl<E>
Default implementation of the spanning tree interface.Methods in org.jgrapht.alg.interfaces that return SpanningTreeAlgorithm.SpanningTree Modifier and Type Method Description SpanningTreeAlgorithm.SpanningTree<E>
SpanningTreeAlgorithm. getSpanningTree()
Computes a spanning tree. -
Uses of SpanningTreeAlgorithm.SpanningTree in org.jgrapht.alg.spanning
Methods in org.jgrapht.alg.spanning that return SpanningTreeAlgorithm.SpanningTree Modifier and Type Method Description SpanningTreeAlgorithm.SpanningTree<E>
BoruvkaMinimumSpanningTree. getSpanningTree()
Computes a spanning tree.SpanningTreeAlgorithm.SpanningTree<E>
KruskalMinimumSpanningTree. getSpanningTree()
Computes a spanning tree.SpanningTreeAlgorithm.SpanningTree<E>
PrimMinimumSpanningTree. getSpanningTree()
Computes a spanning tree.Methods in org.jgrapht.alg.spanning that return types with arguments of type SpanningTreeAlgorithm.SpanningTree Modifier and Type Method Description private java.util.Map<java.lang.Integer,SpanningTreeAlgorithm.SpanningTree<E>>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree. calculateSpanningTrees(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation currentSolution, java.util.Map<java.lang.Integer,SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTrees, java.util.Set<java.lang.Integer> affectedLabels)
Updates the map containing the MSTs for every subset of the partition.Methods in org.jgrapht.alg.spanning with parameters of type SpanningTreeAlgorithm.SpanningTree Modifier and Type Method Description double
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. calculateMaximumDemandOfSubtrees(java.util.Set<V> vertexSubset, SpanningTreeAlgorithm.SpanningTree<E> spanningTree, double totalDemand)
Calculates the maximum demand over all new subtrees induced by the minimum spanning treespanningTree
.Method parameters in org.jgrapht.alg.spanning with type arguments of type SpanningTreeAlgorithm.SpanningTree Modifier and Type Method Description private java.util.Map<java.lang.Integer,SpanningTreeAlgorithm.SpanningTree<E>>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree. calculateSpanningTrees(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation currentSolution, java.util.Map<java.lang.Integer,SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTrees, java.util.Set<java.lang.Integer> affectedLabels)
Updates the map containing the MSTs for every subset of the partition.private Pair<java.util.Set<V>,java.lang.Double>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree. subtree(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation currentSolution, java.util.Set<V> modifiableSet, V v, java.util.Map<java.lang.Integer,SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTree)
Calculates the subtree ofv
with respect to the MST given inpartitionSpanningTree
.
-