Uses of Class
org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
-
Packages that use AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType Package Description org.jgrapht.alg.spanning Spanning tree and spanner algorithms. -
-
Uses of AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType in org.jgrapht.alg.spanning
Fields in org.jgrapht.alg.spanning with type parameters of type AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType Modifier and Type Field Description (package private) java.util.Map<Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>,java.lang.Integer>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. cycleAugmentationLabels
mapping form all improvement graph vertices to their labels corresponding to the base graph for the CMST problem(package private) Graph<Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>,DefaultWeightedEdge>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. improvementGraph
the improvement graph itself(package private) Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. origin
the origin vertex(package private) java.util.Map<Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>,java.lang.Integer>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. pathExchangeVertexMapping
mapping from the pseudo vertices to the label of the subset they are representing(package private) java.util.Map<java.lang.Integer,Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. pseudoVertexMapping
mapping from the label of the subsets to the corresponding vertex mappingMethods in org.jgrapht.alg.spanning that return AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType Modifier and Type Method Description static AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType. valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name.static AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType[]
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType. values()
Returns an array containing the constants of this enum type, in the order they are declared.Methods in org.jgrapht.alg.spanning that return types with arguments of type AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType Modifier and Type Method Description Graph<Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>,DefaultWeightedEdge>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. createImprovementGraph()
Initializes the improvement graph, i.e.private java.util.Map<Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>,java.lang.Integer>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. getImprovementGraphLabelMap()
Returns the mapping that is used in the valid cycle detection algorithm, i.e.Method parameters in org.jgrapht.alg.spanning with type arguments of type AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType Modifier and Type Method Description private Pair<java.util.Set<java.lang.Integer>,java.util.Set<V>>
AhujaOrlinSharmaCapacitatedMinimumSpanningTree. executeNeighborhoodOperation(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation currentSolution, java.util.Map<java.lang.Integer,V> improvementGraphVertexMapping, java.util.Map<Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>,java.lang.Integer> pathExchangeVertexMapping, java.util.Map<V,Pair<java.util.Set<V>,java.lang.Double>> subtrees, GraphWalk<Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>,DefaultWeightedEdge> cycle)
Executes the move operations induced by the calculated cycle in the improvement graph.void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. updateImprovementGraphEdge(Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> v1, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> v2, double newCapacity, double newCost)
Adds an edge betweenv1
andv2
to the improvement graph ifnewCapacity
does not exceed the capacity constraint.private void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. updateOriginNodeConnections(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation currentSolution, java.util.Map<V,Pair<java.util.Set<V>,java.lang.Double>> subtrees, java.util.Map<java.lang.Integer,SpanningTreeAlgorithm.SpanningTree<E>> partitionSpanningTrees, java.util.Set<java.lang.Integer> labelsToUpdate, V v1, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Single, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Subtree)
Updates the edges to the origin vertex.private void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. updateSingleNode(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation currentSolution, java.util.Map<V,Pair<java.util.Set<V>,java.lang.Double>> subtrees, java.util.Set<V> tabuList, int label, double oldWeight, java.util.Set<V> modifiableSet, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> pseudoVertex, V v1, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Single)
Updates all edges fromvertexOfV1Single
to nodes in the subset represented bylabel
.private void
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. updateSubtreeNode(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation currentSolution, java.util.Map<V,Pair<java.util.Set<V>,java.lang.Double>> subtrees, java.util.Set<V> tabuList, int label, double oldWeight, java.util.Set<V> modifiableSet, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> pseudoVertex, V v1, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Subtree)
Updates all edges fromvertexOfV1Single
to nodes in the subset represented bylabel
.private boolean
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph. updateTabuVertices(java.util.Set<V> tabuList, V v1, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Single, Pair<java.lang.Integer,AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Subtree)
Updates all nodes that correspond tov1
and returns if the vertexv1
.
-