Package | Description |
---|---|
com.graphhopper | |
com.graphhopper.routing | |
com.graphhopper.routing.template | |
com.graphhopper.util | |
com.graphhopper.util.details |
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 | Field and Description |
---|---|
protected Path |
BidirPathExtractor.path |
protected Path |
PathExtractor.path |
Modifier and Type | Method and Description |
---|---|
Path |
Path.addDistance(double distance) |
Path |
Path.addTime(long time) |
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) |
Path |
BidirRoutingAlgorithm.calcPath(int from,
int to,
int fromOutEdge,
int toInEdge)
like
RoutingAlgorithm.calcPath(int, int) , but this method also allows to strictly restrict the edge the
path will begin with and the edge it will end with. |
Path |
AbstractBidirAlgo.calcPath(int from,
int to,
int fromOutEdge,
int toInEdge) |
protected Path |
AbstractBidirCHAlgo.createEmptyPath() |
protected Path |
AbstractRoutingAlgorithm.createEmptyPath() |
protected Path |
AbstractNonCHBidirAlgo.createEmptyPath() |
protected Path |
PathExtractor.extract(SPTEntry sptEntry) |
protected Path |
BidirPathExtractor.extract(SPTEntry fwdEntry,
SPTEntry bwdEntry,
double weight) |
protected Path |
AbstractBidirCHAlgo.extractPath() |
protected abstract Path |
AbstractRoutingAlgorithm.extractPath()
To be overwritten from extending class.
|
Path |
DijkstraOneToMany.extractPath() |
protected Path |
Dijkstra.extractPath() |
protected Path |
AStar.extractPath() |
protected abstract Path |
AbstractBidirAlgo.extractPath() |
protected Path |
AbstractNonCHBidirAlgo.extractPath() |
static Path |
PathExtractor.extractPath(Graph graph,
Weighting weighting,
SPTEntry sptEntry) |
static Path |
BidirPathExtractor.extractPath(Graph graph,
Weighting weighting,
SPTEntry fwdEntry,
SPTEntry bwdEntry,
double weight) |
Path |
AlternativeRoute.AlternativeInfo.getPath() |
Path |
AlternativeRouteCH.AlternativeInfo.getPath() |
Path |
AlternativeRouteEdgeCH.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.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) |
List<Path> |
AlternativeRouteCH.calcPaths(int from,
int to) |
List<Path> |
AbstractBidirAlgo.calcPaths(int from,
int to) |
List<Path> |
AlternativeRouteEdgeCH.calcPaths(int from,
int to) |
Modifier and Type | Method and Description |
---|---|
List<AlternativeRoute.AlternativeInfo> |
AlternativeRoute.AlternativeBidirSearch.calcAlternatives(Path bestPath,
int maxPaths,
double maxWeightFactor,
double weightInfluence,
double maxShareFactor,
double shareInfluence,
double minPlateauFactor,
double plateauInfluence) |
static InstructionList |
InstructionsFromEdges.calcInstructions(Path path,
Graph graph,
Weighting weighting,
EncodedValueLookup evLookup,
Translation tr) |
Constructor and Description |
---|
AlternativeInfo(double sortBy,
Path path,
SPTEntry shareStart,
SPTEntry shareEnd,
double shareWeight,
List<String> altNames) |
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(ResponsePath responsePath,
List<Path> paths,
EncodedValueLookup evLookup,
Translation tr) |
Modifier and Type | Method and Description |
---|---|
static Map<String,List<PathDetail>> |
PathDetailsFromEdges.calcDetails(Path path,
EncodedValueLookup evLookup,
Weighting weighting,
List<String> requestedPathDetails,
PathDetailsBuilderFactory pathBuilderFactory,
int previousIndex)
Calculates the PathDetails for a Path.
|
Copyright © 2012–2020. All rights reserved.