Package | Description |
---|---|
com.graphhopper | |
com.graphhopper.routing | |
com.graphhopper.routing.ch | |
com.graphhopper.routing.template | |
com.graphhopper.util |
Modifier and Type | Method and Description |
---|---|
List<Path> |
GraphHopper.calcPaths(GHRequest request,
GHResponse ghRsp)
This method calculates the alternative path list using the low level Path objects.
|
Modifier and Type | Class and Description |
---|---|
class |
PathBidirRef
This class creates a DijkstraPath from two Edge's resulting from a BidirectionalDijkstra
|
class |
PathNative
This class creates a Path from a DijkstraOneToMany algorithm
|
Modifier and Type | Method and Description |
---|---|
Path |
RoutingAlgorithm.calcPath(int from,
int to)
Calculates the best path between the specified nodes.
|
Path |
AlternativeRoute.calcPath(int from,
int to) |
Path |
DijkstraOneToMany.calcPath(int from,
int to) |
Path |
Dijkstra.calcPath(int from,
int to) |
Path |
AStar.calcPath(int from,
int to) |
Path |
AbstractBidirAlgo.calcPath(int from,
int to) |
protected Path |
AStarBidirectionCH.createAndInitPath() |
protected Path |
AbstractBidirAlgo.createAndInitPath() |
protected Path |
DijkstraBidirectionCHNoSOD.createAndInitPath() |
protected Path |
AbstractBidirectionEdgeCHNoSOD.createAndInitPath() |
protected Path |
AbstractRoutingAlgorithm.createEmptyPath() |
Path |
PathNative.extract() |
Path |
Path.extract()
Extracts the Path from the shortest-path-tree determined by sptEntry.
|
Path |
PathBidirRef.extract()
Extracts path from two shortest-path-tree
|
protected abstract Path |
AbstractRoutingAlgorithm.extractPath()
To be overwritten from extending class.
|
Path |
DijkstraOneToMany.extractPath() |
protected Path |
Dijkstra.extractPath() |
protected Path |
AStar.extractPath() |
protected Path |
AbstractBidirAlgo.extractPath() |
Path |
AlternativeRoute.AlternativeInfo.getPath() |
Path |
AlternativeRoute.AlternativeBidirSearch.searchBest(int from,
int to) |
Path |
Path.setDescription(List<String> description) |
Path |
Path.setDistance(double distance) |
protected Path |
Path.setEndNode(int end) |
Path |
Path.setFound(boolean found) |
protected Path |
Path.setFromNode(int from)
We need to remember fromNode explicitly as its not saved in one edgeId of edgeIds.
|
Path |
Path.setSPTEntry(SPTEntry sptEntry) |
Path |
Path.setWeight(double w) |
Modifier and Type | Method and Description |
---|---|
List<Path> |
RoutingAlgorithm.calcPaths(int from,
int to)
Calculates multiple possibilities for a path.
|
List<Path> |
AlternativeRoute.calcPaths(int from,
int to) |
List<Path> |
AbstractRoutingAlgorithm.calcPaths(int from,
int to) |
Constructor and Description |
---|
AlternativeInfo(double sortBy,
Path path,
SPTEntry shareStart,
SPTEntry shareEnd,
double shareWeight,
List<String> altNames) |
Modifier and Type | Class and Description |
---|---|
class |
EdgeBasedPathCH |
class |
Path4CH |
Modifier and Type | Field and Description |
---|---|
protected List<Path> |
ViaRoutingTemplate.pathList |
Modifier and Type | Method and Description |
---|---|
List<Path> |
ViaRoutingTemplate.calcPaths(QueryGraph queryGraph,
RoutingAlgorithmFactory algoFactory,
AlgorithmOptions algoOpts) |
List<Path> |
AlternativeRoutingTemplate.calcPaths(QueryGraph queryGraph,
RoutingAlgorithmFactory algoFactory,
AlgorithmOptions algoOpts) |
List<Path> |
RoutingTemplate.calcPaths(QueryGraph queryGraph,
RoutingAlgorithmFactory algoFactory,
AlgorithmOptions algoOpts)
This method returns a list of Path objects which then can be merged to serve one route with
via points or multiple alternative paths.
|
List<Path> |
RoundTripRoutingTemplate.calcPaths(QueryGraph queryGraph,
RoutingAlgorithmFactory algoFactory,
AlgorithmOptions algoOpts) |
Modifier and Type | Method and Description |
---|---|
void |
RoundTripRoutingTemplate.setPaths(List<Path> pathList) |
Modifier and Type | Method and Description |
---|---|
void |
PathMerger.doWork(PathWrapper altRsp,
List<Path> paths,
EncodingManager encodingManager,
Translation tr) |
Copyright © 2012–2019. All rights reserved.