| Package | Description |
|---|---|
| com.graphhopper.isochrone.algorithm | |
| com.graphhopper.routing | |
| com.graphhopper.util | |
| com.graphhopper.util.details |
| Modifier and Type | Method and Description |
|---|---|
Path |
ShortestPathTree.calcPath(int from,
int to) |
protected Path |
ShortestPathTree.extractPath() |
| Modifier and Type | Field and Description |
|---|---|
protected Path |
PathExtractor.path |
protected Path |
DefaultBidirPathExtractor.path |
| Modifier and Type | Field and Description |
|---|---|
List<Path> |
RoundTripRouting.Result.paths |
List<Path> |
ViaRouting.Result.paths |
| Modifier and Type | Method and Description |
|---|---|
Path |
Path.addDistance(double distance) |
Path |
Path.addTime(long time) |
Path |
Dijkstra.calcPath(int from,
int to) |
Path |
RoutingAlgorithm.calcPath(int from,
int to)
Calculates the best path between the specified nodes.
|
Path |
DijkstraOneToMany.calcPath(int from,
int to) |
Path |
AlternativeRoute.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 |
AbstractNonCHBidirAlgo.createEmptyPath() |
protected Path |
AbstractRoutingAlgorithm.createEmptyPath() |
protected Path |
PathExtractor.extract(SPTEntry sptEntry) |
Path |
BidirPathExtractor.extract(SPTEntry fwdEntry,
SPTEntry bwdEntry,
double bestWeight) |
Path |
DefaultBidirPathExtractor.extract(SPTEntry fwdEntry,
SPTEntry bwdEntry,
double weight) |
protected Path |
Dijkstra.extractPath() |
protected Path |
AbstractBidirCHAlgo.extractPath() |
protected Path |
AbstractNonCHBidirAlgo.extractPath() |
Path |
DijkstraOneToMany.extractPath() |
protected abstract Path |
AbstractRoutingAlgorithm.extractPath()
To be overwritten from extending class.
|
protected Path |
AStar.extractPath() |
protected abstract Path |
AbstractBidirAlgo.extractPath() |
static Path |
PathExtractor.extractPath(Graph graph,
Weighting weighting,
SPTEntry sptEntry) |
static Path |
DefaultBidirPathExtractor.extractPath(Graph graph,
Weighting weighting,
SPTEntry fwdEntry,
SPTEntry bwdEntry,
double weight) |
Path |
AlternativeRouteEdgeCH.AlternativeInfo.getPath() |
Path |
AlternativeRoute.AlternativeInfo.getPath() |
Path |
AlternativeRouteCH.AlternativeInfo.getPath() |
Path |
AlternativeRoute.AlternativeBidirSearch.searchBest(int from,
int to) |
Path |
Path.setDescription(List<String> description) |
Path |
Path.setDistance(double distance) |
Path |
Path.setEndNode(int end) |
Path |
Path.setFound(boolean found) |
Path |
Path.setFromNode(int from)
We need to remember fromNode explicitly as its not saved in one edgeId of edgeIds.
|
Path |
Path.setTime(long time) |
Path |
Path.setWeight(double w) |
| Modifier and Type | Method and Description |
|---|---|
List<Path> |
AlternativeRouteEdgeCH.calcPaths(int from,
int to) |
List<Path> |
RoutingAlgorithm.calcPaths(int from,
int to)
Calculates multiple possibilities for a path.
|
List<Path> |
AbstractRoutingAlgorithm.calcPaths(int from,
int to) |
List<Path> |
AlternativeRoute.calcPaths(int from,
int to) |
List<Path> |
AbstractBidirAlgo.calcPaths(int from,
int to) |
List<Path> |
AlternativeRouteCH.calcPaths(int from,
int to) |
List<Path> |
PathCalculator.calcPaths(int from,
int to,
EdgeRestrictions edgeRestrictions) |
List<Path> |
FlexiblePathCalculator.calcPaths(int from,
int to,
EdgeRestrictions edgeRestrictions) |
List<Path> |
CHPathCalculator.calcPaths(int from,
int to,
EdgeRestrictions edgeRestrictions) |
| 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 | Method and Description |
|---|---|
ResponsePath |
PathMerger.doWork(PointList waypoints,
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–2022. All rights reserved.