Uses of Class
org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex

Packages that use EppsteinShortestPathIterator.PathsGraphVertex

Package	Description
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.

Uses of EppsteinShortestPathIterator.PathsGraphVertex in org.jgrapht.alg.shortestpath

Classes in org.jgrapht.alg.shortestpath that implement interfaces with type arguments of type EppsteinShortestPathIterator.PathsGraphVertex

Modifier and Type	Class	Description
private class	EppsteinShortestPathIterator.PathsGraphVertex	Vertex of the paths graph.

Fields in org.jgrapht.alg.shortestpath declared as EppsteinShortestPathIterator.PathsGraphVertex

Modifier and Type	Field	Description
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.PathsGraphVertex.cross
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.PathsGraphVertex.left
private EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.pathsGraphRoot	Vertex of the paths graph from which the BFS traversal is started.
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.PathsGraphVertex.rest
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.PathsGraphVertex.right

Fields in org.jgrapht.alg.shortestpath with type parameters of type EppsteinShortestPathIterator.PathsGraphVertex

Modifier and Type	Field	Description
private Map<V, EppsteinShortestPathIterator<V,E>.PathsGraphVertex>	EppsteinShortestPathIterator.hMapping	For each vertex $v$ in graph maintains the root of the balanced heap, which corresponds to it.
private List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex>	EppsteinShortestPathIterator.EppsteinGraphPath.pathsGraphVertices	Vertices of the paths graph this path corresponds to.

Methods in org.jgrapht.alg.shortestpath that return EppsteinShortestPathIterator.PathsGraphVertex

Modifier and Type	Method	Description
private EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.getRestHeap(List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> vertices, int i, int size)	Constructs an explicit tree-like representation of the binary heap contained in vertices starting at position i.
private EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.insertPersistently(EppsteinShortestPathIterator<V,E>.PathsGraphVertex root, EppsteinShortestPathIterator<V,E>.PathsGraphVertex vertex)	Inserts vertex into the balanced heap rooted at root in a persistent (non-destructive) way.

Methods in org.jgrapht.alg.shortestpath that return types with arguments of type EppsteinShortestPathIterator.PathsGraphVertex

Modifier and Type	Method	Description
private Pair<EppsteinShortestPathIterator<V,E>.PathsGraphVertex, EppsteinShortestPathIterator<V,E>.PathsGraphVertex>	EppsteinShortestPathIterator.getOutrootAndRestHeapRoot(V v)	Builds outroot and heapification of other sidetracks of v.
private Pair<EppsteinShortestPathIterator<V,E>.PathsGraphVertex, EppsteinShortestPathIterator<V,E>.PathsGraphVertex>	EppsteinShortestPathIterator.getOutrootAndRestHeapRoot(V v)	Builds outroot and heapification of other sidetracks of v.
private List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex>	EppsteinShortestPathIterator.EppsteinGraphPath.getSidetracks(List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> vertices)	Builds sequence of sidetracks in the graph this path corresponds to.

Methods in org.jgrapht.alg.shortestpath with parameters of type EppsteinShortestPathIterator.PathsGraphVertex

Modifier and Type	Method	Description
private void	EppsteinShortestPathIterator.addExtension(EppsteinShortestPathIterator<V,E>.EppsteinGraphPath path, EppsteinShortestPathIterator<V,E>.PathsGraphVertex extendingVertex, double weight)	Adds an extension of paths with extendingVertex being its last element.
int	EppsteinShortestPathIterator.PathsGraphVertex.compareTo(EppsteinShortestPathIterator<V,E>.PathsGraphVertex o)
private EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.insertPersistently(EppsteinShortestPathIterator<V,E>.PathsGraphVertex root, EppsteinShortestPathIterator<V,E>.PathsGraphVertex vertex)	Inserts vertex into the balanced heap rooted at root in a persistent (non-destructive) way.
private void	EppsteinShortestPathIterator.insertVertex(V v, EppsteinShortestPathIterator<V,E>.PathsGraphVertex predecessorHeap)	Guides the process of adding the sidetracks of v to the paths graph.

Method parameters in org.jgrapht.alg.shortestpath with type arguments of type EppsteinShortestPathIterator.PathsGraphVertex

Modifier and Type	Method	Description
private EppsteinShortestPathIterator<V,E>.PathsGraphVertex	EppsteinShortestPathIterator.getRestHeap(List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> vertices, int i, int size)	Constructs an explicit tree-like representation of the binary heap contained in vertices starting at position i.
private List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex>	EppsteinShortestPathIterator.EppsteinGraphPath.getSidetracks(List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> vertices)	Builds sequence of sidetracks in the graph this path corresponds to.
private void	EppsteinShortestPathIterator.heapify(List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> vertices, int size)	Builds a min-heap out of the vertices list
private void	EppsteinShortestPathIterator.siftDown(List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> vertices, int i, int size)
private void	EppsteinShortestPathIterator.swap(List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> vertices, int i, int j)

Constructors in org.jgrapht.alg.shortestpath with parameters of type EppsteinShortestPathIterator.PathsGraphVertex

Modifier	Constructor	Description
(package private)	PathsGraphVertex(EppsteinShortestPathIterator<V,E>.PathsGraphVertex other)	Copy constructor.

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

Modifier	Constructor	Description
(package private)	EppsteinGraphPath(Graph<V,E> graph, List<EppsteinShortestPathIterator<V,E>.PathsGraphVertex> pathsGraphVertices, Map<V, Pair<Double,E>> distanceAndPredecessorMap, double weight)