Package com.graphhopper.routing
Class SPTEntry
java.lang.Object
com.graphhopper.routing.SPTEntry
- All Implemented Interfaces:
Comparable<SPTEntry>
- Direct Known Subclasses:
AStar.AStarEntry
,CHEntry
This class is used to create the shortest-path-tree from linked entities.
- Author:
- Peter Karich
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionint
double
This method returns the weight to the origin e.g.boolean
void
toString()
-
Field Details
-
edge
public int edge -
adjNode
public int adjNode -
weight
public double weight -
parent
-
deleted
public boolean deleted
-
-
Constructor Details
-
SPTEntry
public SPTEntry(int node, double weight) -
SPTEntry
-
-
Method Details
-
setDeleted
public void setDeleted() -
isDeleted
public boolean isDeleted() -
getWeightOfVisitedPath
public double getWeightOfVisitedPath()This method returns the weight to the origin e.g. to the start for the forward SPT and to the destination for the backward SPT. Where the variable 'weight' is used to let heap select smallest *full* weight (from start to destination). -
getParent
-
compareTo
- Specified by:
compareTo
in interfaceComparable<SPTEntry>
-
toString
-