Interface | Description |
---|---|
AllCHEdgesIterator | |
AllEdgesIterator | |
EdgeFilter |
Class used to traverse a graph.
|
FlagEncoder |
This class provides methods to define how a value (like speed or direction) converts to a flag
(currently an integer value), which is stored in an edge.
|
FlagEncoderFactory |
Class | Description |
---|---|
AbstractAlgoPreparation | |
AbstractFlagEncoder |
Abstract class which handles flag decoding and encoding.
|
Bike2WeightFlagEncoder |
Stores two speed values into an edge to support avoiding too much incline
|
BikeCommonFlagEncoder |
Defines bit layout of bicycles (not motorcycles) for speed, access and relations (network).
|
BikeFlagEncoder |
Specifies the settings for cycletouring/trekking
|
Car4WDFlagEncoder |
Defines bit layout for cars with four wheel drive
|
CarFlagEncoder |
Defines bit layout for cars.
|
DefaultEdgeFilter | |
DefaultFlagEncoderFactory |
This class creates FlagEncoders that are already included in the GraphHopper distribution.
|
EncodingManager |
Manager class to register encoder, assign their flag values and check objects with all encoders
during parsing.
|
EncodingManager.AcceptWay | |
EncodingManager.Builder | |
FootFlagEncoder |
Defines bit layout for pedestrians (speed, access, surface, ...).
|
HikeFlagEncoder |
Defines bit layout for hiking
|
LevelEdgeFilter |
Only accepts edges leading to equal and higher level nodes.
|
MotorcycleFlagEncoder |
Defines bit layout for motorbikes
|
MountainBikeFlagEncoder |
Specifies the settings for mountain biking
|
NameSimilarityEdgeFilter |
This class defines the basis for NameSimilarity matching using an EdgeFilter.
|
RacingBikeFlagEncoder |
Specifies the settings for race biking
|
SnapPreventionEdgeFilter | |
TestAlgoCollector | |
TestAlgoCollector.AlgoHelperEntry | |
TestAlgoCollector.OneRun | |
WheelchairFlagEncoder |
A flag encoder for wheelchairs.
|
Enum | Description |
---|---|
EncodingManager.Access | |
PriorityCode |
Used to store a priority value in the way flags of an edge.
|
TraversalMode |
Defines how the graph can be traversed while Dijkstra or similar RoutingAlgorithm is in progress.
|
Copyright © 2012–2020. All rights reserved.