Uses of Package
com.graphhopper.routing

Packages that use com.graphhopper.routing

Package	Description
com.graphhopper
com.graphhopper.isochrone.algorithm
com.graphhopper.reader.osm
com.graphhopper.routing
com.graphhopper.routing.ch
com.graphhopper.routing.lm
com.graphhopper.util
com.graphhopper.util.details

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

Class and Description
OSMReaderConfig
Router
RouterConfig This class contains various parameters that control the behavior of Router.
WeightingFactory

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

Class and Description
AbstractRoutingAlgorithm
Path This class represents the result of a shortest path calculation.
RouterConfig This class contains various parameters that control the behavior of Router.
RoutingAlgorithm Calculates the shortest path from the specified node ids.

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

Class and Description
OSMReaderConfig

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
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
BidirRoutingAlgorithm
DefaultBidirPathExtractor Builds a Path from the two fwd- and bwd-shortest path tree entries of a bidirectional search
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
EdgeRestrictions
FlexiblePathCalculator
HeadingResolver
OSMReaderConfig
Path This class represents the result of a shortest path calculation.
Path.EdgeVisitor The callback used in forEveryEdge.
PathCalculator Implementations of this class allow repeatedly calculating paths for different start/target nodes and edge restrictions
RoundTripRouting.Params
RoundTripRouting.Result
Router.Solver
RouterConfig This class contains various parameters that control the behavior of Router.
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.
ViaRouting.Result
WeightingFactory

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

Class and Description
BidirPathExtractor
BidirRoutingAlgorithm
DefaultBidirPathExtractor Builds a Path from the two fwd- and bwd-shortest path tree entries of a bidirectional search
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
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.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.