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 This class represents the result of a shortest path calculation.
RoutingAlgorithmFactory This interface manages RoutingAlgorithm creation.

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

Class and Description
AbstractBidirAlgo
AbstractBidirCHAlgo Common subclass for bidirectional CH algorithms.
AbstractBidirectionEdgeCHNoSOD
AbstractNonCHBidirAlgo 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.
AStarBidirectionCH
AStarBidirectionEdgeCHNoSOD
BidirPathExtractor Builds a Path from the two fwd- and bwd-shortest path tree entries of a bidirectional search
BidirRoutingAlgorithm
DijkstraBidirectionCHNoSOD
DijkstraBidirectionEdgeCHNoSOD
DijkstraOneToMany A simple dijkstra tuned to perform multiple one to many queries with the same source and different target nodes more efficiently than Dijkstra.
DirectionResolverResult
Path This class represents the result of a shortest path calculation.
Path.EdgeVisitor The callback used in forEveryEdge.
RoutingAlgorithm Calculates the shortest path from the specified node ids.
RoutingAlgorithmFactory This interface manages RoutingAlgorithm creation.
SPTEntry This class is used to create the shortest-path-tree from linked entities.

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

Class and Description
AlgorithmOptions The algorithm options.
BidirPathExtractor Builds a Path from the two fwd- and bwd-shortest path tree entries of a bidirectional search
RoutingAlgorithm Calculates the shortest path from the specified node ids.
RoutingAlgorithmFactory This interface manages RoutingAlgorithm creation.
SPTEntry This class is used to create the shortest-path-tree from linked entities.

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.

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

Class and Description
AlgorithmOptions The algorithm options.
Path This class represents the result of a shortest path calculation.
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 This class represents the result of a shortest path calculation.

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

Class and Description
Path This class represents the result of a shortest path calculation.
Path.EdgeVisitor The callback used in forEveryEdge.