Uses of Class
com.graphhopper.routing.SPTEntry

Packages that use SPTEntry

Package	Description
com.graphhopper.routing
com.graphhopper.routing.ch

Uses of SPTEntry in com.graphhopper.routing

Subclasses of SPTEntry in com.graphhopper.routing

Modifier and Type	Class	Description
static class	AStar.AStarEntry

Fields in com.graphhopper.routing declared as SPTEntry

Modifier and Type	Field	Description
protected SPTEntry	AbstractBidirAlgo.bestBwdEntry
protected SPTEntry	AbstractBidirAlgo.bestFwdEntry
protected SPTEntry	Dijkstra.currEdge
protected SPTEntry	AbstractBidirAlgo.currFrom
protected SPTEntry	AbstractBidirAlgo.currTo
SPTEntry	SPTEntry.parent

Fields in com.graphhopper.routing with type parameters of type SPTEntry

Modifier and Type	Field	Description
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	AbstractBidirAlgo.bestWeightMapFrom
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	AbstractBidirAlgo.bestWeightMapOther
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	AbstractBidirAlgo.bestWeightMapTo
protected PriorityQueue<SPTEntry>	Dijkstra.fromHeap
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	Dijkstra.fromMap

Methods in com.graphhopper.routing that return SPTEntry

Modifier and Type	Method	Description
protected abstract SPTEntry	AbstractBidirCHAlgo.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)	Creates a new entry of the shortest path tree (a SPTEntry or one of its subclasses) during a dijkstra expansion.
protected abstract SPTEntry	AbstractNonCHBidirAlgo.createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)	Creates a new entry of the shortest path tree (a SPTEntry or one of its subclasses) during a dijkstra expansion.
protected SPTEntry	AStarBidirection.createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	AStarBidirectionCH.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	AStarBidirectionEdgeCHNoSOD.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionCHNoSOD.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionRef.createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)
protected abstract SPTEntry	AbstractBidirAlgo.createStartEntry(int node, double weight, boolean reverse)	Creates the root shortest path tree entry for the forward or backward search.
protected SPTEntry	AStarBidirection.createStartEntry(int node, double weight, boolean reverse)
protected SPTEntry	AStarBidirectionCH.createStartEntry(int node, double weight, boolean reverse)
protected SPTEntry	DijkstraBidirectionCHNoSOD.createStartEntry(int node, double weight, boolean reverse)
protected SPTEntry	DijkstraBidirectionRef.createStartEntry(int node, double weight, boolean reverse)
protected SPTEntry	DefaultBidirPathExtractor.followParentsUntilRoot(SPTEntry sptEntry, boolean reverse)
protected SPTEntry	DijkstraBidirectionCHNoSOD.getParent(SPTEntry entry)
protected SPTEntry	DijkstraBidirectionRef.getParent(SPTEntry entry)
SPTEntry	SPTEntry.getParent()
SPTEntry	AlternativeRoute.AlternativeInfo.getShareEnd()
SPTEntry	AlternativeRoute.AlternativeInfo.getShareStart()

Methods in com.graphhopper.routing with parameters of type SPTEntry

Modifier and Type	Method	Description
protected boolean	AbstractBidirCHAlgo.accept(RoutingCHEdgeIteratorState edge, SPTEntry currEdge, boolean reverse)
protected boolean	AbstractBidirectionEdgeCHNoSOD.accept(RoutingCHEdgeIteratorState edge, SPTEntry currEdge, boolean reverse)
protected double	AbstractBidirCHAlgo.calcWeight(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected double	AbstractNonCHBidirAlgo.calcWeight(EdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected double	AStarBidirection.calcWeight(EdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected double	AStarBidirectionCH.calcWeight(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
int	SPTEntry.compareTo(SPTEntry o)
protected abstract SPTEntry	AbstractBidirCHAlgo.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)	Creates a new entry of the shortest path tree (a SPTEntry or one of its subclasses) during a dijkstra expansion.
protected abstract SPTEntry	AbstractNonCHBidirAlgo.createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)	Creates a new entry of the shortest path tree (a SPTEntry or one of its subclasses) during a dijkstra expansion.
protected SPTEntry	AStarBidirection.createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	AStarBidirectionCH.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	AStarBidirectionEdgeCHNoSOD.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionCHNoSOD.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected CHEntry	DijkstraBidirectionEdgeCHNoSOD.createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionRef.createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)
Path	BidirPathExtractor.extract(SPTEntry fwdEntry, SPTEntry bwdEntry, double bestWeight)
Path	DefaultBidirPathExtractor.extract(SPTEntry fwdEntry, SPTEntry bwdEntry, double weight)
protected Path	PathExtractor.extract(SPTEntry sptEntry)
protected void	DefaultBidirPathExtractor.extractBwdPath(SPTEntry sptEntry)
protected void	DefaultBidirPathExtractor.extractFwdPath(SPTEntry sptEntry)
static Path	DefaultBidirPathExtractor.extractPath(Graph graph, Weighting weighting, SPTEntry fwdEntry, SPTEntry bwdEntry, double weight)
static Path	PathExtractor.extractPath(Graph graph, Weighting weighting, SPTEntry sptEntry)
protected SPTEntry	DefaultBidirPathExtractor.followParentsUntilRoot(SPTEntry sptEntry, boolean reverse)
protected int	DefaultBidirPathExtractor.getIncEdge(SPTEntry entry)
protected int	AbstractBidirAlgo.getIncomingEdge(SPTEntry entry)
protected int	AbstractBidirectionEdgeCHNoSOD.getIncomingEdge(SPTEntry entry)
protected abstract double	AbstractBidirAlgo.getInEdgeWeight(SPTEntry entry)
protected double	AbstractBidirCHAlgo.getInEdgeWeight(SPTEntry entry)
protected double	AbstractNonCHBidirAlgo.getInEdgeWeight(SPTEntry entry)
protected SPTEntry	DijkstraBidirectionCHNoSOD.getParent(SPTEntry entry)
protected SPTEntry	DijkstraBidirectionRef.getParent(SPTEntry entry)
protected void	DefaultBidirPathExtractor.processMeetingPoint(SPTEntry fwdEntry, SPTEntry bwdEntry)
protected void	AbstractBidirAlgo.updateBestPath(double edgeWeight, SPTEntry entry, int origEdgeIdForCH, int traversalId, boolean reverse)
protected void	AbstractBidirectionEdgeCHNoSOD.updateBestPath(double edgeWeight, SPTEntry entry, int origEdgeId, int traversalId, boolean reverse)
protected void	AStar.updateBestPath(EdgeIteratorState edgeState, SPTEntry bestSPTEntry, int traversalId)
protected void	Dijkstra.updateBestPath(EdgeIteratorState edgeState, SPTEntry bestSPTEntry, int traversalId)
protected void	AbstractBidirCHAlgo.updateEntry(SPTEntry entry, int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected void	AStarBidirectionCH.updateEntry(SPTEntry entry, int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected void	AStarBidirectionEdgeCHNoSOD.updateEntry(SPTEntry entry, int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected void	DijkstraBidirectionEdgeCHNoSOD.updateEntry(SPTEntry entry, int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)

Constructors in com.graphhopper.routing with parameters of type SPTEntry

Modifier	Constructor	Description
	AlternativeInfo(double sortBy, Path path, SPTEntry shareStart, SPTEntry shareEnd, double shareWeight, List<String> altNames)
	AStarEntry(int edgeId, int adjNode, double weightForHeap, double weightOfVisitedPath, SPTEntry parent)
	SPTEntry(int edgeId, int adjNode, double weight, SPTEntry parent)

Uses of SPTEntry in com.graphhopper.routing.ch

Subclasses of SPTEntry in com.graphhopper.routing.ch

Modifier and Type	Class	Description
class	AStarCHEntry
class	CHEntry

Methods in com.graphhopper.routing.ch with parameters of type SPTEntry

Modifier and Type	Method	Description
int	EdgeBasedCHBidirPathExtractor.getIncEdge(SPTEntry sptEntry)

Constructors in com.graphhopper.routing.ch with parameters of type SPTEntry

Modifier	Constructor	Description
	AStarCHEntry(int edge, int incEdge, int adjNode, double heapWeight, double weightOfVisitedPath, SPTEntry parent)
	CHEntry(int edge, int incEdge, int adjNode, double weight, SPTEntry parent)