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

Packages that use Pair

Package	Description
org.jgrapht.alg.cycle	Algorithms for enumeration of simple cycles in graphs.
org.jgrapht.alg.flow	Flow related algorithms.
org.jgrapht.alg.matching	Algorithms for the computation of matchings.
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
private 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
private 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.flow

Fields in org.jgrapht.alg.flow with type parameters of type Pair

Modifier and Type	Field	Description
(package private) java.util.Map<Pair<V,V>,java.lang.Integer>	PushRelabelMFImpl.PushRelabelDiagnostic.discharges
(package private) java.util.Map<Pair<java.lang.Integer,java.lang.Integer>,java.lang.Integer>	PushRelabelMFImpl.PushRelabelDiagnostic.relabels

Uses of Pair in org.jgrapht.alg.matching

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

Modifier and Type	Method	Description
Pair<java.lang.Double,java.util.Set<E>>	PathGrowingWeightedMatching.DynamicProgrammingPathSolver.getMaximumWeightMatching(Graph<V,E> g, java.util.LinkedList<E> path)	Find the maximum weight matching of a path using dynamic programming.

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.

Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type Pair

Constructor	Description
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)	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	Description
protected java.util.Map<Pair<V,V>,ArrayUnenforcedSet<E>>	FastLookupDirectedSpecifics.touchingVerticesToEdgeMap
protected java.util.Map<Pair<V,V>,ArrayUnenforcedSet<E>>	FastLookupUndirectedSpecifics.touchingVerticesToEdgeMap