Uses of Interface
com.graphhopper.routing.RoutingAlgorithm

Packages that use RoutingAlgorithm

Package	Description
com.graphhopper.isochrone.algorithm
com.graphhopper.routing
com.graphhopper.routing.lm

Uses of RoutingAlgorithm in com.graphhopper.isochrone.algorithm

Classes in com.graphhopper.isochrone.algorithm that implement RoutingAlgorithm

Modifier and Type	Class	Description
class	ShortestPathTree	Computes a shortest path tree by a given weighting.

Uses of RoutingAlgorithm in com.graphhopper.routing

Subinterfaces of RoutingAlgorithm in com.graphhopper.routing

Modifier and Type	Interface	Description
interface	EdgeToEdgeRoutingAlgorithm

Classes in com.graphhopper.routing that implement RoutingAlgorithm

Modifier and Type	Class	Description
class	AbstractBidirAlgo
class	AbstractBidirCHAlgo	Common subclass for bidirectional CH algorithms.
class	AbstractBidirectionEdgeCHNoSOD
class	AbstractNonCHBidirAlgo	Common subclass for bidirectional algorithms.
class	AbstractRoutingAlgorithm
class	AlternativeRoute	This class implements the alternative paths search using the "plateau" and partially the "penalty" method described in the following papers.
class	AlternativeRouteCH	Minimum number-of-moving-parts implementation of alternative route search with contraction hierarchies.
class	AlternativeRouteEdgeCH	Minimum number-of-moving-parts implementation of alternative route search with contraction hierarchies.
class	AStar	This class implements the A* algorithm according to http://en.wikipedia.org/wiki/A*_search_algorithm
class	AStarBidirection	This class implements a bidirectional A* algorithm.
class	AStarBidirectionCH
class	AStarBidirectionEdgeCHNoSOD
class	Dijkstra	Implements a single source shortest path algorithm http://en.wikipedia.org/wiki/Dijkstra's_algorithm
class	DijkstraBidirectionCH	Uses a very simple version of stall-on-demand (SOD) for CH queries to prevent exploring nodes that can not be part of a shortest path.
class	DijkstraBidirectionCHNoSOD
class	DijkstraBidirectionEdgeCHNoSOD
class	DijkstraBidirectionRef	Calculates best path in bidirectional way.
class	DijkstraOneToMany	A simple dijkstra tuned to perform multiple one to many queries with the same source and different target nodes more efficiently than Dijkstra.

Methods in com.graphhopper.routing that return RoutingAlgorithm

Modifier and Type	Method	Description
RoutingAlgorithm	RoutingAlgorithmFactory.createAlgo(Graph g, Weighting w, AlgorithmOptions opts)	This method creates an algorithm out of this factory based on the specified opts and graph.
RoutingAlgorithm	RoutingAlgorithmFactorySimple.createAlgo(Graph g, Weighting w, AlgorithmOptions opts)

Uses of RoutingAlgorithm in com.graphhopper.routing.lm

Methods in com.graphhopper.routing.lm that return RoutingAlgorithm

Modifier and Type	Method	Description
RoutingAlgorithm	LMRoutingAlgorithmFactory.createAlgo(Graph g, Weighting w, AlgorithmOptions opts)