protected boolean |
AbstractBidirCHAlgo.accept(RoutingCHEdgeIteratorState iter,
int prevOrNextEdgeId) |
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 edgeState,
boolean reverse,
int prevOrNextEdgeId) |
protected double |
AbstractBidirCHAlgo.calcWeight(RoutingCHEdgeIteratorState iter,
SPTEntry currEdge,
boolean reverse) |
protected double |
AStarBidirectionCH.calcWeight(RoutingCHEdgeIteratorState iter,
SPTEntry currEdge,
boolean reverse) |
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 int |
AbstractBidirCHAlgo.getOrigEdgeId(RoutingCHEdgeIteratorState edge,
boolean reverse) |
protected int |
AbstractBidirectionEdgeCHNoSOD.getOrigEdgeId(RoutingCHEdgeIteratorState edge,
boolean reverse) |
protected int |
AbstractBidirCHAlgo.getTraversalId(RoutingCHEdgeIteratorState edge,
boolean reverse) |
protected int |
AbstractBidirCHAlgo.getTraversalId(RoutingCHEdgeIteratorState edge,
int origEdgeId,
boolean reverse) |
protected int |
AbstractBidirectionEdgeCHNoSOD.getTraversalId(RoutingCHEdgeIteratorState edge,
int origEdgeId,
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) |