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 
Shortestpath related algorithms.

org.jgrapht.alg.util 
Utilities used by JGraphT algorithms.

org.jgrapht.graph.specifics 
Implementations of specifics for various graph types.

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

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

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.

Modifier and Type  Method and Description 

Map<V,Pair<Double,E>> 
TreeSingleSourcePathsImpl.getDistanceAndPredecessorMap()
Get the internal map used for representing the paths.

Constructor and Description 

TreeSingleSourcePathsImpl(Graph<V,E> g,
V source,
Map<V,Pair<Double,E>> distanceAndPredecessorMap)
Construct a new instance.

Modifier and Type  Class and Description 

class 
UnorderedPair<A,B>
Generic unordered 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.

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

Copyright © 2018. All rights reserved.