| Interface | Description |
|---|---|
| BidirPathExtractor | |
| BidirRoutingAlgorithm | |
| Path.EdgeVisitor |
The callback used in forEveryEdge.
|
| PathCalculator |
Implementations of this class allow repeatedly calculating paths for different start/target nodes and edge restrictions
|
| RoutingAlgorithm |
Calculates the shortest path from the specified node ids.
|
| RoutingAlgorithmFactory |
This interface manages RoutingAlgorithm creation.
|
| WeightingFactory |
| Class | Description |
|---|---|
| AbstractBidirAlgo | |
| AbstractBidirCHAlgo |
Common subclass for bidirectional CH algorithms.
|
| AbstractBidirectionEdgeCHNoSOD | |
| AbstractNonCHBidirAlgo |
Common subclass for bidirectional algorithms.
|
| AbstractRoutingAlgorithm | |
| AlgorithmOptions | |
| AlternativeRoute |
This class implements the alternative paths search using the "plateau" and partially the
"penalty" method described in the following papers.
|
| AlternativeRoute.AlternativeInfo | |
| 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 | |
| CHPathCalculator | |
| DefaultBidirPathExtractor |
Builds a
Path from the two fwd- and bwd-shortest path tree entries of a bidirectional search |
| DefaultWeightingFactory | |
| 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 | |
| EdgeRestrictions | |
| FlexiblePathCalculator | |
| HeadingResolver | |
| InstructionsFromEdges |
This class calculates instructions from the edges in a Path.
|
| OSMReaderConfig | |
| Path |
This class represents the result of a shortest path calculation.
|
| PathExtractor | |
| RoundTripRouting |
Implementation of calculating a route with one or more round trip (route with identical start and
end).
|
| RoundTripRouting.Params | |
| RoundTripRouting.Result | |
| Router | |
| Router.Solver | |
| RouterConfig |
This class contains various parameters that control the behavior of
Router. |
| RoutingAlgorithmFactorySimple |
A simple factory creating normal algorithms (RoutingAlgorithm) without preparation.
|
| SPTEntry |
This class is used to create the shortest-path-tree from linked entities.
|
| ViaRouting |
The methods here can be used to calculate routes with or without via points and implement possible restrictions
like snap preventions, headings and curbsides.
|
| ViaRouting.Result |
Copyright © 2012–2022. All rights reserved.