Uses of Class
org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
Packages that use AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Uses of AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation in org.jgrapht.alg.spanning
Fields in org.jgrapht.alg.spanning declared as AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentationModifier and TypeFieldDescriptionAbstractCapacitatedMinimumSpanningTree.bestSolution
representation of the solution(package private) AbstractCapacitatedMinimumSpanningTree<V,
E>.CapacitatedSpanningTreeSolutionRepresentation AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.capacitatedSpanningTreeSolutionRepresentation
the current solution corresponding to the improvement graphMethods in org.jgrapht.alg.spanning that return AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentationModifier and TypeMethodDescriptionAbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation.clone()
Returns a shallow copy of this solution representation instance.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.getInitialSolution()
Calculates an initial solution depending on whether an initial solution was transferred while construction of the algorithm.EsauWilliamsCapacitatedMinimumSpanningTree.getSolution()
Calculates a partition representation of the capacitated spanning tree.Methods in org.jgrapht.alg.spanning with parameters of type AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentationModifier and TypeMethodDescriptionprivate 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.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.calculateSubtreesOfVertices
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<V, Pair<Set<V>, Double>> subtrees, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTree, Set<Integer> affectedLabels) Updates the map containing the subtrees of all vertices in the graph with respect to the MST in the partition and returns them in map.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.executeNeighborhoodOperation
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<Integer, V> improvementGraphVertexMapping, Map<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, Integer> pathExchangeVertexMapping, Map<V, Pair<Set<V>, Double>> subtrees, GraphWalk<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, DefaultWeightedEdge> cycle) Executes the move operations induced by the calculated cycle in the improvement graph.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.subtree
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Set<V> modifiableSet, V v, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTree) Calculates the subtree ofv
with respect to the MST given inpartitionSpanningTree
.void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updateImprovementGraph
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<V, Pair<Set<V>, Double>> subtrees, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTrees, Set<Integer> labelsToUpdate, Set<V> tabuList) Updates the improvement graph.private void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updateOriginNodeConnections
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<V, Pair<Set<V>, Double>> subtrees, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTrees, Set<Integer> labelsToUpdate, V v1, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Single, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Subtree) Updates the edges to the origin vertex.private void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updatePseudoNodesOfNewLabels
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution) Updates the pseudo nodes corresponding to new subsets in the partition.private void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updateSingleNode
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<V, Pair<Set<V>, Double>> subtrees, Set<V> tabuList, int label, double oldWeight, Set<V> modifiableSet, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> pseudoVertex, V v1, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Single) Updates all edges fromvertexOfV1Single
to nodes in the subset represented bylabel
.private void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updateSubtreeNode
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation currentSolution, Map<V, Pair<Set<V>, Double>> subtrees, Set<V> tabuList, int label, double oldWeight, Set<V> modifiableSet, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> pseudoVertex, V v1, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Subtree) Updates all edges fromvertexOfV1Single
to nodes in the subset represented bylabel
.Constructors in org.jgrapht.alg.spanning with parameters of type AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentationModifierConstructorDescriptionImprovementGraph
(AbstractCapacitatedMinimumSpanningTree<V, E>.CapacitatedSpanningTreeSolutionRepresentation capacitatedSpanningTreeSolutionRepresentation) Constructs an new improvement graph object for this CMST algorithm instance.