| Package | Description |
|---|---|
| com.graphhopper.routing.lm | |
| com.graphhopper.routing.subnetwork | |
| com.graphhopper.search | |
| com.graphhopper.storage | |
| com.graphhopper.storage.index |
| Modifier and Type | Class and Description |
|---|---|
class |
LandmarkStorage
This class stores the landmark nodes and the weights from and to all other nodes in every
subnetwork.
|
| Modifier and Type | Class and Description |
|---|---|
class |
SubnetworkStorage
This class handles storage of subnetwork ids for every node.
|
| Modifier and Type | Class and Description |
|---|---|
class |
NameIndex |
| Modifier and Type | Interface and Description |
|---|---|
interface |
DataAccess
Abstraction of the underlying data structure with a unique id and location.
|
interface |
GraphExtension
If you need custom storages, like turn cost tables, or osmid tables for your graph you implement
this interface and put it in any graph storage you want.
|
interface |
GraphStorage |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractDataAccess |
class |
CHGraphImpl
A Graph implementation necessary for Contraction Hierarchies.
|
static class |
GraphExtension.NoOpExtension
default implementation defines no additional fields or any logic.
|
class |
GraphHopperStorage
This class manages all storage related methods and delegates the calls to the associated graphs.
|
class |
MMapDataAccess
A DataAccess implementation using a memory-mapped file, i.e.
|
class |
RAMDataAccess
This is an in-memory byte-based data structure with the possibility to be stored on flush().
|
class |
StorableProperties
Writes an in-memory HashMap into a file on flush.
|
class |
TurnCostExtension
Holds turn cost tables for each node.
|
class |
UnsafeDataAccess
This is a data structure which uses an unsafe access to native memory.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
LocationIndex
Provides a way to map real world data "lat,lon" to internal ids/indices of a memory efficient graph
- often just implemented as an array.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Location2IDFullIndex
Very slow O(n) LocationIndex but no RAM/disc required.
|
class |
Location2IDFullWithEdgesIndex
Same as full index but calculates distance to all edges too
|
class |
LocationIndexTree
This implementation implements an n-tree to get the closest node or edge from GPS coordinates.
|
Copyright © 2012–2018. All rights reserved.