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
Fields in org.jgrapht.alg.shortestpath declared as EppsteinShortestPathIterator.PathsGraphVertex Modifier and Type Field Description (package private) EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator.PathsGraphVertex. cross
(package private) EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator.PathsGraphVertex. left
private EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator. pathsGraphRoot
Vertex of the paths graph from which the BFS traversal is started.(package private) EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator.PathsGraphVertex. rest
(package private) EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator.PathsGraphVertex. right
Fields in org.jgrapht.alg.shortestpath with type parameters of type EppsteinShortestPathIterator.PathsGraphVertex Modifier and Type Field Description private java.util.Map<V,EppsteinShortestPathIterator.PathsGraphVertex>
EppsteinShortestPathIterator. hMapping
For each vertex $v$ ingraph
maintains the root of the balanced heap, which corresponds to it.private java.util.List<EppsteinShortestPathIterator.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.PathsGraphVertex
EppsteinShortestPathIterator. getRestHeap(java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> vertices, int i, int size)
Constructs an explicit tree-like representation of the binary heap contained invertices
starting at positioni
.private EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator. insertPersistently(EppsteinShortestPathIterator.PathsGraphVertex root, EppsteinShortestPathIterator.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.PathsGraphVertex Modifier and Type Method Description private Pair<EppsteinShortestPathIterator.PathsGraphVertex,EppsteinShortestPathIterator.PathsGraphVertex>
EppsteinShortestPathIterator. getOutrootAndRestHeapRoot(V v)
Builds outroot and heapification of other sidetracks ofv
.private Pair<EppsteinShortestPathIterator.PathsGraphVertex,EppsteinShortestPathIterator.PathsGraphVertex>
EppsteinShortestPathIterator. getOutrootAndRestHeapRoot(V v)
Builds outroot and heapification of other sidetracks ofv
.private java.util.List<EppsteinShortestPathIterator.PathsGraphVertex>
EppsteinShortestPathIterator.EppsteinGraphPath. getSidetracks(java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> vertices)
Builds sequence of sidetracks in thegraph
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.EppsteinGraphPath path, EppsteinShortestPathIterator.PathsGraphVertex extendingVertex, double weight)
Adds an extension ofpaths
withextendingVertex
being its last element.int
EppsteinShortestPathIterator.PathsGraphVertex. compareTo(EppsteinShortestPathIterator.PathsGraphVertex o)
private EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator. insertPersistently(EppsteinShortestPathIterator.PathsGraphVertex root, EppsteinShortestPathIterator.PathsGraphVertex vertex)
Insertsvertex
into the balanced heap rooted atroot
in a persistent (non-destructive) way.private void
EppsteinShortestPathIterator. insertVertex(V v, EppsteinShortestPathIterator.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.PathsGraphVertex Modifier and Type Method Description private EppsteinShortestPathIterator.PathsGraphVertex
EppsteinShortestPathIterator. getRestHeap(java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> vertices, int i, int size)
Constructs an explicit tree-like representation of the binary heap contained invertices
starting at positioni
.private java.util.List<EppsteinShortestPathIterator.PathsGraphVertex>
EppsteinShortestPathIterator.EppsteinGraphPath. getSidetracks(java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> vertices)
Builds sequence of sidetracks in thegraph
this path corresponds to.private void
EppsteinShortestPathIterator. heapify(java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> vertices, int size)
Builds a min-heap out of thevertices
listprivate void
EppsteinShortestPathIterator. siftDown(java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> vertices, int i, int size)
private void
EppsteinShortestPathIterator. swap(java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> vertices, int i, int j)
Constructors in org.jgrapht.alg.shortestpath with parameters of type EppsteinShortestPathIterator.PathsGraphVertex Constructor Description PathsGraphVertex(EppsteinShortestPathIterator.PathsGraphVertex other)
Copy constructor.Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type EppsteinShortestPathIterator.PathsGraphVertex Constructor Description EppsteinGraphPath(Graph<V,E> graph, java.util.List<EppsteinShortestPathIterator.PathsGraphVertex> pathsGraphVertices, java.util.Map<V,Pair<java.lang.Double,E>> distanceAndPredecessorMap, double weight)
-