Uses of Enum 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

Subclasses with type arguments of type AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType in org.jgrapht.alg.spanning

Modifier and Type	Class	Description
private static enum	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType	This enums contains the vertex types of the improvement graph.

Fields in org.jgrapht.alg.spanning with type parameters of type AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType

Modifier and Type	Field	Description
(package private) Map<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, 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<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, DefaultWeightedEdge>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.improvementGraph	the improvement graph itself
(package private) Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.origin	the origin vertex
(package private) Map<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, Integer>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.pathExchangeVertexMapping	mapping from the pseudo vertices to the label of the subset they are representing
(package private) Map<Integer, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.pseudoVertexMapping	mapping from the label of the subsets to the corresponding vertex mapping

Methods in org.jgrapht.alg.spanning that return AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType

Modifier and Type	Method	Description
static AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType.valueOf(String name)	Returns the enum constant of this class with the specified name.
static AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType[]	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType.values()	Returns an array containing the constants of this enum class, 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<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, DefaultWeightedEdge>	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.createImprovementGraph()	Initializes the improvement graph, i.e.
private Map<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, 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<Set<Integer>, Set<V>>	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.
void	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updateImprovementGraphEdge(Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> v1, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> v2, double newCapacity, double newCost)	Adds an edge between v1 and v2 to the improvement graph if newCapacity does not exceed the capacity constraint.
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.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 from vertexOfV1Single to nodes in the subset represented by label.
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 from vertexOfV1Single to nodes in the subset represented by label.
private boolean	AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updateTabuVertices(Set<V> tabuList, V v1, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Single, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> vertexOfV1Subtree)	Updates all nodes that correspond to v1 and returns if the vertex v1.