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 and Description
static class	AStar.AStarEntry

Fields in com.graphhopper.routing declared as SPTEntry

Modifier and Type	Field and 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 and 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 and Description
SPTEntry	SPTEntry.clone()
SPTEntry	SPTEntry.cloneFull()
protected SPTEntry	AStarBidirection.createEntry(EdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionRef.createEntry(EdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected abstract SPTEntry	AbstractNonCHBidirAlgo.createEntry(EdgeIteratorState edge, 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	AbstractBidirCHAlgo.createEntry(RoutingCHEdgeIteratorState edge, 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 SPTEntry	AStarBidirectionEdgeCHNoSOD.createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	AStarBidirectionCH.createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionCHNoSOD.createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	AStarBidirectionCH.createStartEntry(int node, double weight, boolean reverse)
protected SPTEntry	AStarBidirection.createStartEntry(int node, double weight, boolean reverse)
protected SPTEntry	DijkstraBidirectionRef.createStartEntry(int node, double weight, 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	DijkstraBidirectionCHNoSOD.createStartEntry(int node, double weight, boolean reverse)
protected SPTEntry	BidirPathExtractor.followParentsUntilRoot(SPTEntry sptEntry, boolean reverse)
SPTEntry	SPTEntry.getParent()
protected SPTEntry	DijkstraBidirectionRef.getParent(SPTEntry entry)
protected SPTEntry	DijkstraBidirectionCHNoSOD.getParent(SPTEntry entry)
SPTEntry	AlternativeRoute.AlternativeInfo.getShareEnd()
SPTEntry	AlternativeRoute.AlternativeInfo.getShareStart()

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

Modifier and Type	Method and Description
protected boolean	AbstractNonCHBidirAlgo.accept(EdgeIteratorState edge, SPTEntry currEdge, boolean reverse)
protected boolean	AbstractBidirCHAlgo.accept(RoutingCHEdgeIteratorState edge, SPTEntry currEdge, boolean reverse)
protected boolean	AbstractBidirectionEdgeCHNoSOD.accept(RoutingCHEdgeIteratorState edge, SPTEntry currEdge, boolean reverse)
protected double	AStarBidirection.calcWeight(EdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected double	AbstractNonCHBidirAlgo.calcWeight(EdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected double	AbstractBidirCHAlgo.calcWeight(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected double	AStarBidirectionCH.calcWeight(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
int	SPTEntry.compareTo(SPTEntry o)
protected SPTEntry	AStarBidirection.createEntry(EdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionRef.createEntry(EdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected abstract SPTEntry	AbstractNonCHBidirAlgo.createEntry(EdgeIteratorState edge, 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	AbstractBidirCHAlgo.createEntry(RoutingCHEdgeIteratorState edge, 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 SPTEntry	AStarBidirectionEdgeCHNoSOD.createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	AStarBidirectionCH.createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected CHEntry	DijkstraBidirectionEdgeCHNoSOD.createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected SPTEntry	DijkstraBidirectionCHNoSOD.createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
protected Path	PathExtractor.extract(SPTEntry sptEntry)
protected Path	BidirPathExtractor.extract(SPTEntry fwdEntry, SPTEntry bwdEntry, double weight)
protected void	BidirPathExtractor.extractBwdPath(SPTEntry sptEntry)
protected void	BidirPathExtractor.extractFwdPath(SPTEntry sptEntry)
static Path	PathExtractor.extractPath(Graph graph, Weighting weighting, SPTEntry sptEntry)
static Path	BidirPathExtractor.extractPath(Graph graph, Weighting weighting, SPTEntry fwdEntry, SPTEntry bwdEntry, double weight)
protected SPTEntry	BidirPathExtractor.followParentsUntilRoot(SPTEntry sptEntry, boolean reverse)
protected int	BidirPathExtractor.getIncEdge(SPTEntry entry)
protected int	AbstractBidirAlgo.getIncomingEdge(SPTEntry entry)
protected int	AbstractBidirectionEdgeCHNoSOD.getIncomingEdge(SPTEntry entry)
protected double	AbstractBidirCHAlgo.getInEdgeWeight(SPTEntry entry)
protected abstract double	AbstractBidirAlgo.getInEdgeWeight(SPTEntry entry)
protected double	AbstractNonCHBidirAlgo.getInEdgeWeight(SPTEntry entry)
protected SPTEntry	DijkstraBidirectionRef.getParent(SPTEntry entry)
protected SPTEntry	DijkstraBidirectionCHNoSOD.getParent(SPTEntry entry)
protected void	BidirPathExtractor.processMeetingPoint(SPTEntry fwdEntry, SPTEntry bwdEntry)
protected void	AbstractBidirAlgo.updateBestPath(double edgeWeight, SPTEntry entry, int origEdgeId, int traversalId, boolean reverse)
protected void	AbstractBidirectionEdgeCHNoSOD.updateBestPath(double edgeWeight, SPTEntry entry, int origEdgeId, int traversalId, boolean reverse)
protected void	Dijkstra.updateBestPath(EdgeIteratorState edgeState, SPTEntry bestSPTEntry, int traversalId)
protected void	AStar.updateBestPath(EdgeIteratorState edgeState, SPTEntry bestSPTEntry, int traversalId)
protected void	AStarBidirection.updateEntry(SPTEntry entry, EdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)
protected void	AbstractNonCHBidirAlgo.updateEntry(SPTEntry entry, EdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)
protected void	AbstractBidirCHAlgo.updateEntry(SPTEntry entry, RoutingCHEdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)
protected void	AStarBidirectionEdgeCHNoSOD.updateEntry(SPTEntry entry, RoutingCHEdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)
protected void	AStarBidirectionCH.updateEntry(SPTEntry entry, RoutingCHEdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)
protected void	DijkstraBidirectionEdgeCHNoSOD.updateEntry(SPTEntry entry, RoutingCHEdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)

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

Constructor and Description
AlternativeInfo(double sortBy, Path path, SPTEntry shareStart, SPTEntry shareEnd, double shareWeight, List<String> altNames)

Uses of SPTEntry in com.graphhopper.routing.ch

Subclasses of SPTEntry in com.graphhopper.routing.ch

Modifier and Type	Class and Description
class	AStarCHEntry
class	CHEntry

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

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