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	Graph Drawing.
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.linkprediction	Algorithms for link prediction
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.
org.jgrapht.alg.util	Utilities used by JGraphT algorithms.
org.jgrapht.demo	Demo programs that help to get started with JGraphT.
org.jgrapht.graph.specifics	Implementations of specifics for various graph types.
org.jgrapht.nio	Importers/Exporters for various graph formats.
org.jgrapht.opt.graph.sparse	Specialized graph implementations using sparse matrix representations.
org.jgrapht.opt.graph.sparse.specifics	Implementations of different sparse graphs with different tradeoffs.
org.jgrapht.sux4j	Immutable graphs stored using Sux4J's quasi-succinct data structures.

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<V,E>.EdgeNode,HierholzerEulerianCycle<V,E>.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<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.

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<?,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

Modifier and Type	Method	Description
protected Pair<List<V>,List<V>>	TwoLayeredBipartiteLayout2D.computePartitions(Graph<V,E> graph)	Compute the vertex partitions.

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
Map<Integer,Pair<Set<V>,Double>>	CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree.getPartition()	Return the label-to-partition map of the underlying partition of capacitated spanning tree.
Map<Integer,Pair<Set<V>,Double>>	CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl.getPartition()

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

Modifier and Type	Method	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
default List<Triple<V,V,Double>>	LinkPredictionAlgorithm.predict(List<Pair<V,V>> queries)	Predict an edge between a set of vertex pairs.

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
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.linkprediction

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

Modifier and Type	Method	Description
Pair<?,?>	LinkPredictionIndexNotWellDefinedException.getVertexPair()	Get the vertex pair which caused the error.

Methods in org.jgrapht.alg.linkprediction with parameters of type Pair

Modifier and Type	Method	Description
void	LinkPredictionIndexNotWellDefinedException.setVertexPair(Pair<?,?> vertexPair)	Set the vertex pair which caused the error.

Constructors in org.jgrapht.alg.linkprediction with parameters of type Pair

Modifier	Constructor	Description
	LinkPredictionIndexNotWellDefinedException(String message, Pair<?,?> vertexPair)	Constructs a new exception with the specified detail message.

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 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	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

Modifier	Constructor	Description
	BidirectionalDijkstraShortestPath(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.
	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 given hierarchy, radius and 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.
	TreeSingleSourcePathsImpl(Graph<V,E> g, V source, Map<V,Pair<Double,E>> distanceAndPredecessorMap)	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 given graph, source, sink and heapSupplier.
	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 given graph, source, sink, heapSupplier and pathValidator.

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.demo

Methods in org.jgrapht.demo that return types with arguments of type Pair

Modifier and Type	Method	Description
KnightTour.DoublyLinkedList<Pair<Integer,Integer>>	KnightTour.getList()
ArrayList<KnightTour.Node<Pair<Integer,Integer>>>	KnightTour.getStructured()
List<Pair<Integer,Integer>>	KnightTour.toList()	Converts knight's tour represented as DoublyLinkedList to ArrayList.

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 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)}.

Uses of Pair in org.jgrapht.nio

Method parameters in org.jgrapht.nio with type arguments of type Pair

Modifier and Type	Method	Description
void	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.opt.graph.sparse

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

Modifier	Constructor	Description
	SparseIntDirectedGraph(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 stream
	SparseIntUndirectedGraph(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

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

Modifier	Constructor	Description
	CSRBooleanMatrix(int rows, int columns, List<Pair<Integer,Integer>> entries)	Create a new CSR boolean matrix
	IncidenceMatrixSparseUndirectedSpecifics(int numVertices, int numEdges, Supplier<Stream<Pair<Integer,Integer>>> edges)	Create a new graph from an edge stream
	IncomingNoReindexSparseDirectedSpecifics(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 Pair

Modifier	Constructor	Description
	SuccinctDirectedGraph(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.
	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.