Uses of Class
org.jgrapht.alg.util.Pair

Packages that use Pair

Package	Description
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.interfaces

Method parameters in org.jgrapht.alg.interfaces with type arguments of type Pair

Modifier and Type	Method and Description
default List<V>	LowestCommonAncestorAlgorithm.getBatchLCA(List<Pair<V,V>> queries) Return a list of LCAs for a batch of queries
default List<Set<V>>	LowestCommonAncestorAlgorithm.getBatchLCASet(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 and Description
List<V>	TarjanLCAFinder.getBatchLCA(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 and Description
protected Map<V,Pair<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 and Description
Map<V,Pair<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 and Description
TreeSingleSourcePathsImpl(Graph<V,E> g, V source, Map<V,Pair<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 and Description
class	UnorderedPair<A,B> Generic unordered pair.

Methods in org.jgrapht.alg.util that return Pair

Modifier and Type	Method and Description
static <A,B> Pair<A,B>	Pair.of(A a, B b) Creates new pair of elements pulling of the necessity to provide corresponding types of the elements supplied.

Uses of Pair in org.jgrapht.graph.specifics

Fields in org.jgrapht.graph.specifics with type parameters of type Pair

Modifier and Type	Field and Description
protected Map<Pair<V,V>,Set<E>>	FastLookupDirectedSpecifics.touchingVerticesToEdgeMap Maps a pair of vertices <u,v> to a set of edges {(u,v)}.
protected Map<Pair<V,V>,Set<E>>	FastLookupUndirectedSpecifics.touchingVerticesToEdgeMap Maps a pair of vertices <u,v> to a set of edges {(u,v)}.

Constructor parameters in org.jgrapht.graph.specifics with type arguments of type Pair

Constructor and Description
FastLookupDirectedSpecifics(Graph<V,E> graph, Map<V,DirectedEdgeContainer<V,E>> vertexMap, Map<Pair<V,V>,Set<E>> touchingVerticesToEdgeMap, EdgeSetFactory<V,E> edgeSetFactory) Construct a new fast lookup directed specifics.
FastLookupUndirectedSpecifics(Graph<V,E> graph, Map<V,UndirectedEdgeContainer<V,E>> vertexMap, Map<Pair<V,V>,Set<E>> touchingVerticesToEdgeMap, EdgeSetFactory<V,E> edgeSetFactory) Construct a new fast lookup undirected specifics.