| Package | Description |
|---|---|
| com.graphhopper.routing | |
| com.graphhopper.storage |
| Modifier and Type | Class and Description |
|---|---|
static class |
AStar.AStarEntry |
| Modifier and Type | Field and Description |
|---|---|
protected SPTEntry |
Dijkstra.currEdge |
protected SPTEntry |
AbstractBidirAlgo.currFrom |
protected SPTEntry |
AbstractBidirAlgo.currTo |
protected SPTEntry |
PathBidirRef.edgeTo |
protected SPTEntry |
Path.sptEntry
Shortest path tree entry
|
| 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 |
| Modifier and Type | Method and Description |
|---|---|
protected SPTEntry |
AStarBidirection.createEntry(EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected SPTEntry |
DijkstraBidirectionRef.createEntry(EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected abstract SPTEntry |
AbstractBidirAlgo.createEntry(EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected SPTEntry |
DijkstraBidirectionRef.createStartEntry(int node,
double weight,
boolean reverse) |
protected abstract SPTEntry |
AbstractBidirAlgo.createStartEntry(int node,
double weight,
boolean reverse) |
protected SPTEntry |
DijkstraBidirectionRef.getParent(SPTEntry entry) |
SPTEntry |
AlternativeRoute.AlternativeInfo.getShareEnd() |
SPTEntry |
AlternativeRoute.AlternativeInfo.getShareStart() |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
AbstractBidirAlgo.accept(EdgeIteratorState edge,
SPTEntry currEdge,
boolean reverse) |
protected double |
AStarBidirection.calcWeight(EdgeIteratorState iter,
SPTEntry currEdge,
boolean reverse) |
protected double |
AbstractBidirAlgo.calcWeight(EdgeIteratorState iter,
SPTEntry currEdge,
boolean reverse) |
protected SPTEntry |
AStarBidirection.createEntry(EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected SPTEntry |
DijkstraBidirectionRef.createEntry(EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected abstract SPTEntry |
AbstractBidirAlgo.createEntry(EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected SPTEntry |
DijkstraBidirectionRef.getParent(SPTEntry entry) |
Path |
Path.setSPTEntry(SPTEntry sptEntry) |
PathBidirRef |
PathBidirRef.setSPTEntryTo(SPTEntry edgeTo) |
protected void |
Dijkstra.updateBestPath(EdgeIteratorState edgeState,
SPTEntry bestSPTEntry,
int traversalId) |
protected void |
AStar.updateBestPath(EdgeIteratorState edgeState,
SPTEntry bestSPTEntry,
int traversalId) |
protected void |
AbstractBidirAlgo.updateBestPath(EdgeIteratorState edgeState,
SPTEntry entry,
int traversalId,
boolean reverse) |
protected void |
AStarBidirection.updateEntry(SPTEntry entry,
EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected void |
AbstractBidirAlgo.updateEntry(SPTEntry entry,
EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
| Constructor and Description |
|---|
AlternativeInfo(double sortBy,
Path path,
SPTEntry shareStart,
SPTEntry shareEnd,
double shareWeight,
List<String> altNames) |
| Modifier and Type | Field and Description |
|---|---|
SPTEntry |
SPTEntry.parent |
| Modifier and Type | Method and Description |
|---|---|
SPTEntry |
SPTEntry.clone() |
SPTEntry |
SPTEntry.cloneFull() |
SPTEntry |
SPTEntry.getParent() |
| Modifier and Type | Method and Description |
|---|---|
int |
SPTEntry.compareTo(SPTEntry o) |
Copyright © 2012–2018. All rights reserved.