Uses of Package
com.graphhopper.routing

Packages that use com.graphhopper.routing

Package	Description
com.graphhopper
com.graphhopper.routing
com.graphhopper.routing.ch
com.graphhopper.routing.lm
com.graphhopper.routing.template
com.graphhopper.routing.util
com.graphhopper.util
com.graphhopper.util.details

Classes in com.graphhopper.routing used by com.graphhopper

Class and Description
Path Stores the nodes for the found path of an algorithm.
RoutingAlgorithmFactory This interface manages RoutingAlgorithm creation.
RoutingAlgorithmFactoryDecorator

Classes in com.graphhopper.routing used by com.graphhopper.routing

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.
DijkstraBidirectionCHNoSOD
DijkstraBidirectionRef Calculates best path in bidirectional way.
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.
Path.EdgeVisitor The callback used in forEveryEdge.
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.
RecalculationHook An interface with which you can trigger a heuristic change of the underlying algorithm.
RoutingAlgorithm Calculates the shortest path from the specified node ids.
RoutingAlgorithmFactory This interface manages RoutingAlgorithm creation.

Classes in com.graphhopper.routing used by com.graphhopper.routing.ch

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

Classes in com.graphhopper.routing used by com.graphhopper.routing.lm

Class and Description
AlgorithmOptions The algorithm options.
RoutingAlgorithm Calculates the shortest path from the specified node ids.
RoutingAlgorithmFactory This interface manages RoutingAlgorithm creation.
RoutingAlgorithmFactoryDecorator

Classes in com.graphhopper.routing used by com.graphhopper.routing.template

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.

Classes in com.graphhopper.routing used by com.graphhopper.routing.util

Class and Description
AlgorithmOptions The algorithm options.
RoutingAlgorithmFactory This interface manages RoutingAlgorithm creation.

Classes in com.graphhopper.routing used by com.graphhopper.util

Class and Description
Path Stores the nodes for the found path of an algorithm.

Classes in com.graphhopper.routing used by com.graphhopper.util.details

Class and Description
Path.EdgeVisitor The callback used in forEveryEdge.