Uses of Class
org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
Packages that use EppsteinShortestPathIterator.PathsGraphVertex
-
Uses of EppsteinShortestPathIterator.PathsGraphVertex in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath declared as EppsteinShortestPathIterator.PathsGraphVertexModifier and TypeFieldDescription(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.PathsGraphVertexModifier and TypeFieldDescriptionprivate Map
<V, EppsteinShortestPathIterator<V, E>.PathsGraphVertex> EppsteinShortestPathIterator.hMapping
For each vertex $v$ ingraph
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.PathsGraphVertexModifier and TypeMethodDescriptionprivate 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 invertices
starting at positioni
.private EppsteinShortestPathIterator<V,
E>.PathsGraphVertex EppsteinShortestPathIterator.insertPersistently
(EppsteinShortestPathIterator<V, E>.PathsGraphVertex root, EppsteinShortestPathIterator<V, E>.PathsGraphVertex vertex) Insertsvertex
into the balanced heap rooted atroot
in a persistent (non-destructive) way.Methods in org.jgrapht.alg.shortestpath that return types with arguments of type EppsteinShortestPathIterator.PathsGraphVertexModifier and TypeMethodDescriptionprivate Pair
<EppsteinShortestPathIterator<V, E>.PathsGraphVertex, EppsteinShortestPathIterator<V, E>.PathsGraphVertex> EppsteinShortestPathIterator.getOutrootAndRestHeapRoot
(V v) Builds outroot and heapification of other sidetracks ofv
.private Pair
<EppsteinShortestPathIterator<V, E>.PathsGraphVertex, EppsteinShortestPathIterator<V, E>.PathsGraphVertex> EppsteinShortestPathIterator.getOutrootAndRestHeapRoot
(V v) Builds outroot and heapification of other sidetracks ofv
.private List
<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> EppsteinShortestPathIterator.EppsteinGraphPath.getSidetracks
(List<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> vertices) Builds sequence of sidetracks in thegraph
this path corresponds to.Methods in org.jgrapht.alg.shortestpath with parameters of type EppsteinShortestPathIterator.PathsGraphVertexModifier and TypeMethodDescriptionprivate void
EppsteinShortestPathIterator.addExtension
(EppsteinShortestPathIterator<V, E>.EppsteinGraphPath path, EppsteinShortestPathIterator<V, E>.PathsGraphVertex extendingVertex, double weight) Adds an extension ofpaths
withextendingVertex
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) Insertsvertex
into the balanced heap rooted atroot
in a persistent (non-destructive) way.private void
EppsteinShortestPathIterator.insertVertex
(V v, EppsteinShortestPathIterator<V, E>.PathsGraphVertex predecessorHeap) Guides the process of adding the sidetracks ofv
to the paths graph.Method parameters in org.jgrapht.alg.shortestpath with type arguments of type EppsteinShortestPathIterator.PathsGraphVertexModifier and TypeMethodDescriptionprivate 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 invertices
starting at positioni
.private List
<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> EppsteinShortestPathIterator.EppsteinGraphPath.getSidetracks
(List<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> vertices) Builds sequence of sidetracks in thegraph
this path corresponds to.private void
EppsteinShortestPathIterator.heapify
(List<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> vertices, int size) Builds a min-heap out of thevertices
listprivate 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.PathsGraphVertexModifierConstructorDescription(package private)
Copy constructor.Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type EppsteinShortestPathIterator.PathsGraphVertexModifierConstructorDescription(package private)
EppsteinGraphPath
(Graph<V, E> graph, List<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> pathsGraphVertices, Map<V, Pair<Double, E>> distanceAndPredecessorMap, double weight)