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 Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.calculateSpanningTrees(AbstractCapacitatedMinimumSpanningTree<V,E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTrees, Set<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(Set<V> vertexSubset, SpanningTreeAlgorithm.SpanningTree<E> spanningTree, double totalDemand)	Calculates the maximum demand over all new subtrees induced by the minimum spanning tree spanningTree.

Method parameters in org.jgrapht.alg.spanning with type arguments of type SpanningTreeAlgorithm.SpanningTree

Modifier and Type	Method	Description
private Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.calculateSpanningTrees(AbstractCapacitatedMinimumSpanningTree<V,E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTrees, Set<Integer> affectedLabels)	Updates the map containing the MSTs for every subset of the partition.
private Pair<Set<V>,Double>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.subtree(AbstractCapacitatedMinimumSpanningTree<V,E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Set<V> modifiableSet, V v, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTree)	Calculates the subtree of v with respect to the MST given in partitionSpanningTree.