Uses of Class
org.jgrapht.alg.util.Pair
Packages that use Pair
Package
Description
Graph clustering algorithms.
Algorithms related to graph cycles.
Algorithms for computing maximum density subgraphs.
Graph Drawing.
Graph Drawing Basic Types and Models.
Flow related algorithms.
Algorithms for minimum cost flow
Algorithm related interfaces.
Algorithms for (sub)graph isomorphism.
Algorithms for computing lowest common ancestors in graphs.
Algorithms for link prediction
Algorithms for the computation of matchings.
Package for Kolmogorov's Blossom V algorithm
Shortest-path related algorithms.
Spanning tree and spanner algorithms.
Utilities used by JGraphT algorithms.
Network generator components
Implementations of specifics for various graph types.
Importers/Exporters for various graph formats.
DOT importers/exporters
Graph Exchange XML Format (GEXF) importers/exporters.
GML importers/exporters
Graph6, sparse6 and digraph6 importers/exporters
GraphML importers/exporters
Json importers/exporters
Specialized graph implementations using sparse matrix representations.
Implementations of different sparse graphs with different tradeoffs.
Immutable graphs stored using Sux4J's quasi-succinct data
structures.
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
-
Uses of Pair in org.jgrapht.alg.clustering
Methods in org.jgrapht.alg.clustering that return PairModifier and TypeMethodDescriptionLabelPropagationClustering.Implementation.getNeighborLabelCountsAndMaximum
(V v) Compute the frequency of the labels of all neighbors of a vertex and the maximum frequency of the vertices, which have a label not equal to the input vertex label. -
Uses of Pair in org.jgrapht.alg.cycle
Methods in org.jgrapht.alg.cycle that return PairModifier and TypeMethodDescriptionAbstractFundamentalCycleBasis.buildFundamentalCycle
(E e, Map<V, E> spanningForest) Given a non-tree edge and a spanning tree (forest) build a fundamental cycle.WeakChordalityInspector.checkLabels
(List<List<Integer>> coConnectedComponents, List<Pair<Integer, Integer>> separator) For a given coconnected component of theseparator
checks whether every vertex in it is seen by al least one vertex of the edge that is separated by theseparator
protected Pair
<HierholzerEulerianCycle<V, E>.EdgeNode, HierholzerEulerianCycle<V, E>.EdgeNode> HierholzerEulerianCycle.computePartialCycle()
Computes a partial cycle assuming that all vertices have an even degree.JohnsonSimpleCycles.findMinSCSG
(int startIndex) Methods in org.jgrapht.alg.cycle that return types with arguments of type PairModifier and TypeMethodDescriptionWeakChordalityInspector.computeGlobalSeparatorList()
Computes the global separator list of thegraph
.WeakChordalityInspector.computeGlobalSeparatorList()
Computes the global separator list of thegraph
.WeakChordalityInspector.reformatSeparatorList
(List<Set<V>> separators, E edge) Reformats the list oseparators
so that is can be conveniently used by this inspector.WeakChordalityInspector.reformatSeparatorList
(List<Set<V>> separators, E edge) Reformats the list oseparators
so that is can be conveniently used by this inspector.Methods in org.jgrapht.alg.cycle with parameters of type PairModifier and TypeMethodDescriptionprotected void
HierholzerEulerianCycle.updateGraphAndInsertLocations
(Pair<HierholzerEulerianCycle<V, E>.EdgeNode, HierholzerEulerianCycle<V, E>.EdgeNode> partialCycle, HierholzerEulerianCycle<V, E>.VertexNode partialCycleSourceVertex) Iterate over the partial cycle to remove vertices with zero degrees and compute new insert locations for vertices with non-zero degrees.Method parameters in org.jgrapht.alg.cycle with type arguments of type PairModifier and TypeMethodDescriptionWeakChordalityInspector.computeCoConnectedComponents
(Graph<V, E> graph, List<Pair<Integer, Integer>> separator) Computes the connected components of the complement of the graph induces by the vertices of theseparator
.private void
Sorts theseparators
using bucket sortprivate void
Sorts theseparators
using bucket sortprivate boolean
WeakChordalityInspector.unequalSeparators
(List<Pair<Integer, Integer>> sep1, List<Pair<Integer, Integer>> sep2) Compares two separators for inequality. -
Uses of Pair in org.jgrapht.alg.densesubgraph
Classes in org.jgrapht.alg.densesubgraph with type parameters of type PairModifier and TypeClassDescriptionclass
GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight<V extends Pair<?,
Double>, E> This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.class
GoldbergMaximumDensitySubgraphAlgorithmNodeWeights<V extends Pair<?,
Double>, E> This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley. -
Uses of Pair in org.jgrapht.alg.drawing
Methods in org.jgrapht.alg.drawing that return Pair -
Uses of Pair in org.jgrapht.alg.drawing.model
Methods in org.jgrapht.alg.drawing.model that return PairModifier and TypeMethodDescriptionBoxes.splitAlongXAxis
(Box2D box) Split a box along the x axis into two equal boxes.Boxes.splitAlongYAxis
(Box2D box) Split a box along the y axis into two equal boxes. -
Uses of Pair in org.jgrapht.alg.flow
Fields in org.jgrapht.alg.flow with type parameters of type Pair -
Uses of Pair in org.jgrapht.alg.flow.mincost
Methods in org.jgrapht.alg.flow.mincost that return PairModifier and TypeMethodDescriptionCapacityScalingMinimumCostFlow.scale
(int delta) Performs a scaling phase by saturating all negative reduced cost arcs with residual capacity greater than or equal to thedelta
, so that they don't belong to the $\Delta$-residual network and, hence, don't violate optimality conditions. -
Uses of Pair in org.jgrapht.alg.interfaces
Fields in org.jgrapht.alg.interfaces with type parameters of type PairModifier and TypeFieldDescriptionCapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl.partition
Methods in org.jgrapht.alg.interfaces that return types with arguments of type PairModifier and TypeMethodDescriptionCapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree.getPartition()
Return the label-to-partition map of the underlying partition of capacitated spanning tree.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl.getPartition()
Method parameters in org.jgrapht.alg.interfaces with type arguments of type PairModifier and TypeMethodDescriptionLowestCommonAncestorAlgorithm.getBatchLCA
(List<Pair<V, V>> queries) Return a list of LCAs for a batch of queriesLowestCommonAncestorAlgorithm.getBatchLCASet
(List<Pair<V, V>> queries) Return a list of computed sets of LCAs for a batch of queriesPredict an edge between a set of vertex pairs. -
Uses of Pair in org.jgrapht.alg.isomorphism
Fields in org.jgrapht.alg.isomorphism declared as PairMethods in org.jgrapht.alg.isomorphism that return PairModifier and TypeMethodDescriptionColorRefinementIsomorphismInspector.splitColoring
(VertexColoringAlgorithm.Coloring<ColorRefinementIsomorphismInspector.DistinctGraphObject<V, V, E>> coloring) Splits up the coloring of the union graph into the two colorings of the original graphs -
Uses of Pair in org.jgrapht.alg.lca
Fields in org.jgrapht.alg.lca with type parameters of type PairMethod parameters in org.jgrapht.alg.lca with type arguments of type Pair -
Uses of Pair in org.jgrapht.alg.linkprediction
Fields in org.jgrapht.alg.linkprediction declared as PairModifier and TypeFieldDescriptionprivate Pair
<?, ?> LinkPredictionIndexNotWellDefinedException.vertexPair
Methods in org.jgrapht.alg.linkprediction that return PairModifier and TypeMethodDescriptionPair
<?, ?> LinkPredictionIndexNotWellDefinedException.getVertexPair()
Get the vertex pair which caused the error.Methods in org.jgrapht.alg.linkprediction with parameters of type PairModifier and TypeMethodDescriptionvoid
LinkPredictionIndexNotWellDefinedException.setVertexPair
(Pair<?, ?> vertexPair) Set the vertex pair which caused the error.Constructors in org.jgrapht.alg.linkprediction with parameters of type PairModifierConstructorDescriptionLinkPredictionIndexNotWellDefinedException
(String message, Pair<?, ?> vertexPair) Constructs a new exception with the specified detail message. -
Uses of Pair in org.jgrapht.alg.matching
Fields in org.jgrapht.alg.matching with type parameters of type PairModifier and TypeFieldDescriptionDenseEdmondsMaximumCardinalityMatching.bridges
For each odd vertex condensed into a blossom, a bridge is defined.Methods in org.jgrapht.alg.matching that return PairModifier and TypeMethodDescriptionPathGrowingWeightedMatching.DynamicProgrammingPathSolver.getMaximumWeightMatching
(Graph<V, E> g, LinkedList<E> path) Find the maximum weight matching of a path using dynamic programming. -
Uses of Pair in org.jgrapht.alg.matching.blossom.v5
Methods in org.jgrapht.alg.matching.blossom.v5 that return PairModifier and TypeMethodDescriptionprivate Pair
<BlossomVNode, BlossomVNode> KolmogorovWeightedPerfectMatching.lca
(BlossomVNode a, BlossomVNode b) Returns $(b, b)$ in the case where the verticesa
andb
have a common ancestor blossom $b$. -
Uses of Pair in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath declared as PairModifier and TypeFieldDescription(package private) Pair
<ContractionHierarchyPrecomputation.ContractionEdge<E1>, ContractionHierarchyPrecomputation.ContractionEdge<E1>> ContractionHierarchyPrecomputation.ContractionEdge.bypassedEdges
Pair of edges this edge bypasses in case it is a shortcut.Fields in org.jgrapht.alg.shortestpath with type parameters of type PairModifier and TypeFieldDescriptionprivate Map
<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.backwardSearchSpaces
Stores backward search space for each target vertex.YenShortestPathIterator.candidatePaths
Heap of the candidate path generated so far and sorted my their weights.private Map
<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.distanceAndMiddleVertexMap
Stores pair of path weight and middle vertex for each source-target pair.private Map
<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.distanceAndMiddleVertexMap
Stores pair of path weight and middle vertex for each source-target pair.DeltaSteppingShortestPath.distanceAndPredecessorMap
Map to store predecessor for each vertex in the shortest path tree.EppsteinShortestPathIterator.distanceAndPredecessorMap
Shortest paths tree in the edge reversed graphgraph
rooted atsink
.EppsteinShortestPathIterator.EppsteinGraphPath.distanceAndPredecessorMap
Shortest paths tree in the edge reversed graphgraph
rooted atsink
.private Map
<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.forwardSearchSpaces
Stores forward search space for each start vertex.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier.heap
DijkstraClosestFirstIterator.heap
BidirectionalDijkstraShortestPath.heapSupplier
private Supplier
<org.jheaps.AddressableHeap<Double, Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> ContractionHierarchyBidirectionalDijkstra.heapSupplier
Supplier for preferable heap implementation.DijkstraShortestPath.heapSupplier
TreeSingleSourcePathsImpl.map
A map which keeps for each target vertex the predecessor edge and the total length of the shortest path.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier.seen
DijkstraClosestFirstIterator.seen
private List
<List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> ContractionHierarchyPrecomputation.shortcutEdges
Lists of shortcuts that correspond to vertices in thecontractionGraph
.(package private) List
<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>> ContractionHierarchyPrecomputation.ToListConsumer.shortcuts
Resulting list of shortcuts.Methods in org.jgrapht.alg.shortestpath that return PairModifier and TypeMethodDescriptionprivate Pair
<TransitNodeRoutingPrecomputation.AccessVertices<V, E>, TransitNodeRoutingPrecomputation.LocalityFilter<V>> TransitNodeRoutingPrecomputation.computeAVAndLF()
Computes in parallel access vertices and locality filter for the transit node routing.YenShortestPathIterator.getMaskedVerticesAndEdges
(GraphPath<V, E> path, V pathDeviation, int pathDeviationIndex) For the givenpath
builds sets of vertices and edges to be masked.private Pair
<TransitNodeRoutingPrecomputation.AccessVertex<V, E>, TransitNodeRoutingPrecomputation.AccessVertex<V, E>> TransitNodeRoutingShortestPath.getMinWeightAccessVertices
(V source, V sink) For verticessource
andsink
finds pair of access vertices with smallest weight over all pairs.private Pair
<EppsteinShortestPathIterator<V, E>.PathsGraphVertex, EppsteinShortestPathIterator<V, E>.PathsGraphVertex> EppsteinShortestPathIterator.getOutrootAndRestHeapRoot
(V v) Builds outroot and heapification of other sidetracks ofv
.TransitNodeRoutingPrecomputation.ContractionHierarchyBFS.runSearch
(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex) Runs a forward CH BFS query to calculate access vertices and ids of visited Voronoi cells.Methods in org.jgrapht.alg.shortestpath that return types with arguments of type PairModifier and TypeMethodDescriptionprivate Map
<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>> CHManyToManyShortestPaths.getDistanceAndPredecessorMap
(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> targets) Computes distance and predecessor map for a single source shortest paths search starting at source and finishing the search as soon as alltargets
are reached.DijkstraClosestFirstIterator.getDistanceAndPredecessorMap()
Return all paths using the traditional representation of the shortest path tree, which stores for each vertex (a) the distance of the path from the source vertex and (b) the last edge used to reach the vertex from the source vertex.TreeSingleSourcePathsImpl.getDistanceAndPredecessorMap()
Get the internal map used for representing the paths.private List
<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>> ContractionHierarchyPrecomputation.getShortcuts
(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex) Computes shortcuts for vertexvertex
wrt the overlay graph.Constructors in org.jgrapht.alg.shortestpath with parameters of type PairModifierConstructorDescription(package private)
ContractionEdge
(Pair<ContractionHierarchyPrecomputation.ContractionEdge<E1>, ContractionHierarchyPrecomputation.ContractionEdge<E1>> bypassedEdges) Constrcuts a contraction edge for the given pair of bypassed edges.Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type PairModifierConstructorDescriptionBidirectionalDijkstraShortestPath
(Graph<V, E> graph, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance for a specified graph.BidirectionalDijkstraShortestPath
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance for a specified graph.CHManyToManyShortestPathsImpl
(Graph<V, E> graph, ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, Set<V> sources, Set<V> targets, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceAndMiddleVertexMap) Constructs a new instance for the givengraph
,contractionGraph
,contractionMapping
,forwardSearchSpaces
,backwardSearchSpaces
anddistanceAndMiddleVertexMap
.ContractionHierarchyBidirectionalDijkstra
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> heapSupplier) Constructs a new instance of the algorithm for the givenhierarchy
,radius
andheapSupplier
.(package private)
ContractionSearchFrontier
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs an instance of a search frontier for the given graph, heap supplier andisDownwardEdge
function.DijkstraClosestFirstIterator
(Graph<V, E> graph, V source, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Creates a new radius-bounded iterator for the specified graph.DijkstraClosestFirstIterator
(Graph<V, E> graph, V source, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Creates a new iterator for the specified graph.(package private)
DijkstraSearchFrontier
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) DijkstraShortestPath
(Graph<V, E> graph, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance of the algorithm for a given graph.DijkstraShortestPath
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance of the algorithm for a given graph.(package private)
EppsteinGraphPath
(Graph<V, E> graph, List<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> pathsGraphVertices, Map<V, Pair<Double, E>> distanceAndPredecessorMap, double weight) Construct a new instance.YenShortestPathIterator
(Graph<V, E> graph, V source, V sink, Supplier<org.jheaps.AddressableHeap<Double, Pair<GraphPath<V, E>, Boolean>>> heapSupplier) Constructs an instance of the algorithm for givengraph
,source
,sink
andheapSupplier
.YenShortestPathIterator
(Graph<V, E> graph, V source, V sink, Supplier<org.jheaps.AddressableHeap<Double, Pair<GraphPath<V, E>, Boolean>>> heapSupplier, PathValidator<V, E> pathValidator) Constructs an instance of the algorithm for givengraph
,source
,sink
,heapSupplier
andpathValidator
.(package private)
YenShortestPathsTree
(Graph<V, E> maskSubgraph, Set<V> maskedVertices, Set<E> maskedEdges, Map<V, Pair<Double, E>> reversedTree, V treeSource) Constructs an instance of the shortest paths tree for the givenmaskSubgraph
,maskedVertices
,maskedEdges
,reversedTree
,treeSource
. -
Uses of Pair in org.jgrapht.alg.spanning
Fields in org.jgrapht.alg.spanning declared as PairModifier and TypeFieldDescription(package private) Pair
<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.origin
the origin vertexFields in org.jgrapht.alg.spanning with type parameters of type PairModifier and TypeFieldDescription(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 itselfAbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation.partition
the implicit partition defined by the subtrees(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 mappingMethods in org.jgrapht.alg.spanning that return PairModifier and TypeMethodDescriptionAhujaOrlinSharmaCapacitatedMinimumSpanningTree.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
.Methods in org.jgrapht.alg.spanning that return types with arguments of type PairModifier and TypeMethodDescriptionAhujaOrlinSharmaCapacitatedMinimumSpanningTree.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.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.Methods in org.jgrapht.alg.spanning with parameters of type PairModifier and TypeMethodDescriptionvoid
AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.updateImprovementGraphEdge
(Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType> v1, Pair<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<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 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
.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 tov1
and returns if the vertexv1
.Method parameters in org.jgrapht.alg.spanning with type arguments of type PairModifier and TypeMethodDescriptionAhujaOrlinSharmaCapacitatedMinimumSpanningTree.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.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.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
. -
Uses of Pair in org.jgrapht.alg.util
Subclasses of Pair in org.jgrapht.alg.utilMethods in org.jgrapht.alg.util that return Pair -
Uses of Pair in org.jgrapht.generate.netgen
Methods in org.jgrapht.generate.netgen that return Pair -
Uses of Pair in org.jgrapht.graph.specifics
Fields in org.jgrapht.graph.specifics with type parameters of type PairModifier and TypeFieldDescriptionFastLookupDirectedSpecifics.touchingVerticesToEdgeMap
Maps a pair of vertices <u,v> to a set of edges {(u,v)}.FastLookupUndirectedSpecifics.touchingVerticesToEdgeMap
Maps a pair of vertices <u,v> to a set of edges {(u,v)}. -
Uses of Pair in org.jgrapht.nio
Fields in org.jgrapht.nio with type parameters of type PairModifier and TypeFieldDescriptionBaseEventDrivenImporter.edgeAttributeConsumers
BaseEventDrivenImporter.vertexAttributeConsumers
Method parameters in org.jgrapht.nio with type arguments of type PairModifier and TypeMethodDescriptionvoid
BaseEventDrivenImporter.addEdgeAttributeConsumer
(BiConsumer<Pair<E, String>, Attribute> consumer) Add an edge attribute consumer.void
EventDrivenImporter.addEdgeAttributeConsumer
(BiConsumer<Pair<E, String>, Attribute> consumer) Add an edge attribute consumer.void
BaseEventDrivenImporter.addVertexAttributeConsumer
(BiConsumer<Pair<V, String>, Attribute> consumer) Add a vertex attribute consumer.void
EventDrivenImporter.addVertexAttributeConsumer
(BiConsumer<Pair<V, String>, Attribute> consumer) Add a vertex attribute consumer.void
BaseEventDrivenImporter.removeEdgeAttributeConsumer
(BiConsumer<Pair<E, String>, Attribute> consumer) Remove an edge attribute consumer.void
EventDrivenImporter.removeEdgeAttributeConsumer
(BiConsumer<Pair<E, String>, Attribute> consumer) Remove an edge attribute consumer.void
BaseEventDrivenImporter.removeVertexAttributeConsumer
(BiConsumer<Pair<V, String>, Attribute> consumer) Remove a vertex attribute consumer.void
EventDrivenImporter.removeVertexAttributeConsumer
(BiConsumer<Pair<V, String>, Attribute> consumer) Remove a vertex attribute consumer. -
Uses of Pair in org.jgrapht.nio.dot
Fields in org.jgrapht.nio.dot declared as PairFields in org.jgrapht.nio.dot with type parameters of type PairModifier and TypeFieldDescriptionDOTImporter.Consumers.edgeAttributeConsumer
DOTImporter.Consumers.edgeAttributeConsumer
DOTImporter.Consumers.edgeConsumer
DOTImporter.Consumers.edgeWithAttributesConsumer
final BiConsumer
<Pair<String, String>, Attribute> DOTImporter.Consumers.vertexAttributeConsumer
-
Uses of Pair in org.jgrapht.nio.gexf
Fields in org.jgrapht.nio.gexf with type parameters of type PairModifier and TypeFieldDescriptionSimpleGEXFImporter.Consumers.edgeAttributeConsumer
final BiConsumer
<Pair<String, String>, Attribute> SimpleGEXFImporter.Consumers.vertexAttributeConsumer
-
Uses of Pair in org.jgrapht.nio.gml
Fields in org.jgrapht.nio.gml with type parameters of type PairModifier and TypeFieldDescriptionGmlImporter.Consumers.edgeAttributeConsumer
final BiConsumer
<Pair<Integer, String>, Attribute> GmlImporter.Consumers.vertexAttributeConsumer
-
Uses of Pair in org.jgrapht.nio.graph6
Fields in org.jgrapht.nio.graph6 with type parameters of type Pair -
Uses of Pair in org.jgrapht.nio.graphml
Fields in org.jgrapht.nio.graphml with type parameters of type PairModifier and TypeFieldDescriptionGraphMLImporter.Consumers.edgeAttributeConsumer
SimpleGraphMLEdgeListImporter.Consumers.edgeAttributeConsumer
SimpleGraphMLImporter.Consumers.edgeAttributeConsumer
final BiConsumer
<Pair<String, String>, Attribute> GraphMLImporter.Consumers.vertexAttributeConsumer
final BiConsumer
<Pair<String, String>, Attribute> SimpleGraphMLImporter.Consumers.vertexAttributeConsumer
-
Uses of Pair in org.jgrapht.nio.json
Fields in org.jgrapht.nio.json with type parameters of type PairModifier and TypeFieldDescriptionJSONImporter.Consumers.edgeAttributeConsumer
final BiConsumer
<Pair<String, String>, Attribute> JSONImporter.Consumers.vertexAttributeConsumer
-
Uses of Pair in org.jgrapht.opt.graph.sparse
Constructor parameters in org.jgrapht.opt.graph.sparse with type arguments of type PairModifierConstructorDescriptionSparseIntDirectedGraph
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges, IncomingEdgesSupport incomingEdgesSupport) Create a new graph from an edge stream.SparseIntDirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges) Create a new graph from an edge list.SparseIntDirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges, IncomingEdgesSupport incomingEdgesSupport) Create a new graph from an edge list.SparseIntUndirectedGraph
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges) Create a new graph from an edge streamSparseIntUndirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges) Create a new graph from an edge list -
Uses of Pair in org.jgrapht.opt.graph.sparse.specifics
Fields in org.jgrapht.opt.graph.sparse.specifics with type parameters of type PairModifier and TypeFieldDescriptionprivate static final Comparator
<Pair<Integer, Integer>> CSRBooleanMatrix.INTEGER_PAIR_LEX_COMPARATOR
Constructor parameters in org.jgrapht.opt.graph.sparse.specifics with type arguments of type PairModifierConstructorDescriptionCSRBooleanMatrix
(int rows, int columns, List<Pair<Integer, Integer>> entries) Create a new CSR boolean matrixIncidenceMatrixSparseUndirectedSpecifics
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges) Create a new graph from an edge streamIncomingNoReindexSparseDirectedSpecifics
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges, boolean lazyIncomingEdges) Create a new graph from an edge list.NoIncomingNoReindexSparseDirectedSpecifics
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges) Create a new graph from an edge list. -
Uses of Pair in org.jgrapht.sux4j
Constructor parameters in org.jgrapht.sux4j with type arguments of type PairModifierConstructorDescriptionCreates a new immutable succinct directed graph from a supplier of streams of edges, supporting both outgoing and incoming edges.SuccinctDirectedGraph
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges, boolean incomingEdgesSupport) Creates a new immutable succinct directed graph from a supplier of streams of edges, choosing whether to support incoming edges.SuccinctDirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges) Creates a new immutable succinct directed graph from an edge list, supporting both outgoing and incoming edges.SuccinctDirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges, boolean incomingEdgesSupport) Creates a new immutable succinct directed graph from an edge list, choosing whether to support incoming edges.SuccinctIntDirectedGraph
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges) Creates a new immutable succinct directed graph from a supplier of streams of edges, supporting both outgoing and incoming edges.SuccinctIntDirectedGraph
(int numVertices, int numEdges, Supplier<Stream<Pair<Integer, Integer>>> edges, boolean incomingEdgesSupport) Creates a new immutable succinct directed graph from a supplier of streams of edges, choosing whether to support incoming edges.SuccinctIntDirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges) Creates a new immutable succinct directed graph from an edge list, supporting both outgoing and incoming edges.SuccinctIntDirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges, boolean incomingEdgesSupport) Creates a new immutable succinct directed graph from an edge list, choosing whether to support incoming edges.SuccinctIntUndirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges) Creates a new immutable succinct undirected graph from an edge list.SuccinctUndirectedGraph
(int numVertices, List<Pair<Integer, Integer>> edges) Creates a new immutable succinct undirected graph from an edge list. -
Uses of Pair in org.jgrapht.util
Methods in org.jgrapht.util that return PairModifier and TypeMethodDescriptionprivate Pair
<DoublyLinkedList.ListNodeImpl<E>, Integer> DoublyLinkedList.searchNode
(Supplier<DoublyLinkedList.ListNodeImpl<E>> first, UnaryOperator<DoublyLinkedList.ListNodeImpl<E>> next, Object element) Returns aPair
of the first encounteredDoublyLinkedList.ListNode
in this list, whosevalue
is equal to the givenelement
, and its index.