Uses of Class
org.jgrapht.alg.util.Pair
-
Packages that use Pair Package Description org.jgrapht.alg.cycle Algorithms related to graph cycles.org.jgrapht.alg.densesubgraph Algorithms for computing maximum density subgraphs.org.jgrapht.alg.drawing.model Graph Drawing Basic Types and Models.org.jgrapht.alg.interfaces Algorithm related interfaces.org.jgrapht.alg.lca Algorithms for computing lowest common ancestors in graphs.org.jgrapht.alg.shortestpath Shortest-path related algorithms.org.jgrapht.alg.util Utilities used by JGraphT algorithms.org.jgrapht.graph.specifics Implementations of specifics for various graph types. -
-
Uses of Pair in org.jgrapht.alg.cycle
Methods in org.jgrapht.alg.cycle that return Pair Modifier and Type Method Description protected Pair<HierholzerEulerianCycle.EdgeNode,HierholzerEulerianCycle.EdgeNode>
HierholzerEulerianCycle. computePartialCycle()
Computes a partial cycle assuming that all vertices have an even degree.Methods in org.jgrapht.alg.cycle with parameters of type Pair Modifier and Type Method Description protected void
HierholzerEulerianCycle. updateGraphAndInsertLocations(Pair<HierholzerEulerianCycle.EdgeNode,HierholzerEulerianCycle.EdgeNode> partialCycle, HierholzerEulerianCycle.VertexNode partialCycleSourceVertex)
Iterate over the partial cycle to remove vertices with zero degrees and compute new insert locations for vertices with non-zero degrees. -
Uses of Pair in org.jgrapht.alg.densesubgraph
Classes in org.jgrapht.alg.densesubgraph with type parameters of type Pair Modifier and Type Class Description class
GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight<V extends Pair<?,java.lang.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<?,java.lang.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.model
Methods in org.jgrapht.alg.drawing.model that return Pair Modifier and Type Method Description static Pair<Box2D,Box2D>
Boxes. splitAlongXAxis(Box2D box)
Split a box along the x axis into two equal boxes.static Pair<Box2D,Box2D>
Boxes. splitAlongYAxis(Box2D box)
Split a box along the y axis into two equal boxes. -
Uses of Pair in org.jgrapht.alg.interfaces
Methods in org.jgrapht.alg.interfaces that return types with arguments of type Pair Modifier and Type Method Description java.util.Map<java.lang.Integer,Pair<java.util.Set<V>,java.lang.Double>>
CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree. getPartition()
Return the label-to-partition map of the underlying partition of capacitated spanning tree.java.util.Map<java.lang.Integer,Pair<java.util.Set<V>,java.lang.Double>>
CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl. getPartition()
Method parameters in org.jgrapht.alg.interfaces with type arguments of type Pair Modifier and Type Method Description default java.util.List<V>
LowestCommonAncestorAlgorithm. getBatchLCA(java.util.List<Pair<V,V>> queries)
Return a list of LCAs for a batch of queriesdefault java.util.List<java.util.Set<V>>
LowestCommonAncestorAlgorithm. getBatchLCASet(java.util.List<Pair<V,V>> queries)
Return a list of computed sets of LCAs for a batch of queries -
Uses of Pair in org.jgrapht.alg.lca
Method parameters in org.jgrapht.alg.lca with type arguments of type Pair Modifier and Type Method Description java.util.List<V>
TarjanLCAFinder. getBatchLCA(java.util.List<Pair<V,V>> queries)
Return a list of LCAs for a batch of queries -
Uses of Pair in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath with type parameters of type Pair Modifier and Type Field Description protected java.util.Map<V,Pair<java.lang.Double,E>>
TreeSingleSourcePathsImpl. map
A map which keeps for each target vertex the predecessor edge and the total length of the shortest path.Methods in org.jgrapht.alg.shortestpath that return types with arguments of type Pair Modifier and Type Method Description java.util.Map<V,Pair<java.lang.Double,E>>
TreeSingleSourcePathsImpl. getDistanceAndPredecessorMap()
Get the internal map used for representing the paths.Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type Pair Constructor Description BidirectionalDijkstraShortestPath(Graph<V,E> graph, double radius, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)
Constructs a new instance for a specified graph.BidirectionalDijkstraShortestPath(Graph<V,E> graph, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)
Constructs a new instance for a specified graph.ContractionHierarchyBidirectionalDijkstra(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> hierarchy, double radius, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> heapSupplier)
Constructs a new instance of the algorithm for the givenhierarchy
,radius
andheapSupplier
.DijkstraShortestPath(Graph<V,E> graph, double radius, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)
Constructs a new instance of the algorithm for a given graph.DijkstraShortestPath(Graph<V,E> graph, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)
Constructs a new instance of the algorithm for a given graph.TreeSingleSourcePathsImpl(Graph<V,E> g, V source, java.util.Map<V,Pair<java.lang.Double,E>> distanceAndPredecessorMap)
Construct a new instance. -
Uses of Pair in org.jgrapht.alg.util
Subclasses of Pair in org.jgrapht.alg.util Modifier and Type Class Description class
UnorderedPair<A,B>
Generic unordered pair.Methods in org.jgrapht.alg.util that return Pair Modifier and Type Method Description static <A,B>
Pair<A,B>Pair. of(A a, B b)
Create a new pair. -
Uses of Pair in org.jgrapht.graph.specifics
Fields in org.jgrapht.graph.specifics with type parameters of type Pair Modifier and Type Field Description protected java.util.Map<Pair<V,V>,java.util.Set<E>>
FastLookupDirectedSpecifics. touchingVerticesToEdgeMap
Maps a pair of vertices <u,v> to a set of edges {(u,v)}.protected java.util.Map<Pair<V,V>,java.util.Set<E>>
FastLookupUndirectedSpecifics. touchingVerticesToEdgeMap
Maps a pair of vertices <u,v> to a set of edges {(u,v)}.
-