Interface | Description |
---|---|
BidirRoutingAlgorithm | |
Path.EdgeVisitor |
The callback used in forEveryEdge.
|
RoutingAlgorithm |
Calculates the shortest path from the specified node ids.
|
RoutingAlgorithmFactory |
This interface manages RoutingAlgorithm creation.
|
Class | Description |
---|---|
AbstractBidirAlgo | |
AbstractBidirCHAlgo |
Common subclass for bidirectional CH algorithms.
|
AbstractBidirectionEdgeCHNoSOD | |
AbstractNonCHBidirAlgo |
Common subclass for bidirectional algorithms.
|
AbstractRoutingAlgorithm | |
AlgorithmOptions |
The algorithm options.
|
AlgorithmOptions.Builder | |
AlternativeRoute |
This class implements the alternative paths search using the "plateau" and partially the
"penalty" method described in the following papers.
|
AlternativeRoute.AlternativeBidirSearch |
Helper class to find alternatives and alternatives for round trip.
|
AlternativeRoute.AlternativeInfo | |
AlternativeRoute.PlateauInfo | |
AlternativeRouteCH |
Minimum number-of-moving-parts implementation of alternative route search with
contraction hierarchies.
|
AlternativeRouteCH.AlternativeInfo | |
AlternativeRouteCH.PotentialAlternativeInfo | |
AlternativeRouteEdgeCH |
Minimum number-of-moving-parts implementation of alternative route search with
contraction hierarchies.
|
AlternativeRouteEdgeCH.AlternativeInfo | |
AlternativeRouteEdgeCH.PotentialAlternativeInfo | |
AStar |
This class implements the A* algorithm according to
http://en.wikipedia.org/wiki/A*_search_algorithm
|
AStar.AStarEntry | |
AStarBidirection |
This class implements a bidirectional A* algorithm.
|
AStarBidirectionCH | |
AStarBidirectionEdgeCHNoSOD | |
BidirPathExtractor |
Builds a
Path from the two fwd- and bwd-shortest path tree entries of a bidirectional search |
Dijkstra |
Implements a single source shortest path algorithm
http://en.wikipedia.org/wiki/Dijkstra's_algorithm
|
DijkstraBidirectionCH |
Uses a very simple version of stall-on-demand (SOD) for CH queries to prevent exploring nodes that can not be part
of a shortest path.
|
DijkstraBidirectionCHNoSOD | |
DijkstraBidirectionEdgeCHNoSOD | |
DijkstraBidirectionRef |
Calculates best path in bidirectional way.
|
DijkstraOneToMany |
A simple dijkstra tuned to perform multiple one to many queries with the same source and different target nodes
more efficiently than
Dijkstra . |
DirectionResolver |
This class is used to determine the pairs of edges that go into/out of a node of the routing graph.
|
DirectionResolverResult | |
InstructionsFromEdges |
This class calculates instructions from the edges in a Path.
|
Path |
This class represents the result of a shortest path calculation.
|
PathExtractor | |
ProfileResolver |
Before the `profile` parameter was introduced in #1958 the cost-function used for route calculations could be
specified by setting the vehicle and weighting parameters as well as the turn_costs/edge_based flags.
|
RoutingAlgorithmFactorySimple |
A simple factory creating normal algorithms (RoutingAlgorithm) without preparation.
|
SPTEntry |
This class is used to create the shortest-path-tree from linked entities.
|
Copyright © 2012–2020. All rights reserved.