Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class IntVertexDijkstraShortestPath.Algorithm
java.lang.Object
org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- Enclosing class:
IntVertexDijkstraShortestPath<E>
The actual implementation class. We use this inner class pattern in order to allow the user
to keep a reference to the implementation class, but allow the garbage collector to collect
the auxiliary memory used during the algorithm's execution.
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate double[]
private IntVertexDijkstraShortestPath<E>.IdentifierMap
private E[]
private int
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptiongetPathsWithIdMap
(Integer source, Integer target) getPathsWithoutIdMap
(Integer source, Integer target)
-
Field Details
-
totalVertices
private int totalVertices -
heap
-
nodes
-
dist
private double[] dist -
pred
-
idMap
-
-
Constructor Details
-
Algorithm
public Algorithm()
-
-
Method Details
-
getPaths
-
getPathsWithoutIdMap
public ShortestPathAlgorithm.SingleSourcePaths<Integer,E> getPathsWithoutIdMap(Integer source, Integer target) -
getPathsWithIdMap
public ShortestPathAlgorithm.SingleSourcePaths<Integer,E> getPathsWithIdMap(Integer source, Integer target) -
getPath
-