Package | Description |
---|---|
com.graphhopper | |
com.graphhopper.routing | |
com.graphhopper.routing.ch | |
com.graphhopper.routing.template | |
com.graphhopper.routing.util | |
com.graphhopper.util |
Class and Description |
---|
Path
Stores the nodes for the found path of an algorithm.
|
RoutingAlgorithmFactory
This interface manages RoutingAlgorithm creation.
|
RoutingAlgorithmFactoryDecorator |
Class and Description |
---|
AbstractBidirAlgo
Common subclass for bidirectional algorithms.
|
AbstractRoutingAlgorithm |
AlgorithmOptions
The algorithm options.
|
AlgorithmOptions.Builder |
AlternativeRoute.AlternativeInfo |
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.
|
DijkstraOneToMany
A simple dijkstra tuned to perform one to many queries more efficient than Dijkstra.
|
Path
Stores the nodes for the found path of an algorithm.
|
PathBidirRef
This class creates a DijkstraPath from two Edge's resulting from a BidirectionalDijkstra
|
QueryGraph
A class which is used to query the underlying graph with real GPS points.
|
RoutingAlgorithm
Calculates the shortest path from the specified node ids.
|
RoutingAlgorithmFactory
This interface manages RoutingAlgorithm creation.
|
Class and Description |
---|
AlgorithmOptions
The algorithm options.
|
Path
Stores the nodes for the found path of an algorithm.
|
PathBidirRef
This class creates a DijkstraPath from two Edge's resulting from a BidirectionalDijkstra
|
RoutingAlgorithm
Calculates the shortest path from the specified node ids.
|
RoutingAlgorithmFactory
This interface manages RoutingAlgorithm creation.
|
RoutingAlgorithmFactoryDecorator |
Class and Description |
---|
AlgorithmOptions
The algorithm options.
|
Path
Stores the nodes for the found path of an algorithm.
|
QueryGraph
A class which is used to query the underlying graph with real GPS points.
|
RoutingAlgorithmFactory
This interface manages RoutingAlgorithm creation.
|
Class and Description |
---|
AlgorithmOptions
The algorithm options.
|
RoutingAlgorithm
Calculates the shortest path from the specified node ids.
|
Class and Description |
---|
Path
Stores the nodes for the found path of an algorithm.
|
Copyright © 2012–2016. All rights reserved.