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>
private class IntVertexDijkstraShortestPath.Algorithm extends java.lang.Object
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
Fields Modifier and Type Field Description private double[]
dist
private org.jheaps.AddressableHeap<java.lang.Double,java.lang.Integer>
heap
private IntVertexDijkstraShortestPath.IdentifierMap
idMap
private org.jheaps.AddressableHeap.Handle<java.lang.Double,java.lang.Integer>[]
nodes
private E[]
pred
private int
totalVertices
-
Constructor Summary
Constructors Constructor Description Algorithm()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description GraphPath<java.lang.Integer,E>
getPath(java.lang.Integer source, java.lang.Integer target)
ShortestPathAlgorithm.SingleSourcePaths<java.lang.Integer,E>
getPaths(java.lang.Integer source)
ShortestPathAlgorithm.SingleSourcePaths<java.lang.Integer,E>
getPathsWithIdMap(java.lang.Integer source, java.lang.Integer target)
ShortestPathAlgorithm.SingleSourcePaths<java.lang.Integer,E>
getPathsWithoutIdMap(java.lang.Integer source, java.lang.Integer target)
-
-
-
Field Detail
-
totalVertices
private int totalVertices
-
heap
private org.jheaps.AddressableHeap<java.lang.Double,java.lang.Integer> heap
-
nodes
private org.jheaps.AddressableHeap.Handle<java.lang.Double,java.lang.Integer>[] nodes
-
dist
private double[] dist
-
pred
private E[] pred
-
idMap
private IntVertexDijkstraShortestPath.IdentifierMap idMap
-
-
Method Detail
-
getPaths
public ShortestPathAlgorithm.SingleSourcePaths<java.lang.Integer,E> getPaths(java.lang.Integer source)
-
getPathsWithoutIdMap
public ShortestPathAlgorithm.SingleSourcePaths<java.lang.Integer,E> getPathsWithoutIdMap(java.lang.Integer source, java.lang.Integer target)
-
getPathsWithIdMap
public ShortestPathAlgorithm.SingleSourcePaths<java.lang.Integer,E> getPathsWithIdMap(java.lang.Integer source, java.lang.Integer target)
-
-