Uses of Interface
com.graphhopper.routing.EdgeToEdgeRoutingAlgorithm

Packages that use EdgeToEdgeRoutingAlgorithm

Package	Description
com.graphhopper.routing
com.graphhopper.routing.ch

Uses of EdgeToEdgeRoutingAlgorithm in com.graphhopper.routing

Classes in com.graphhopper.routing that implement EdgeToEdgeRoutingAlgorithm

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	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	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.

Uses of EdgeToEdgeRoutingAlgorithm in com.graphhopper.routing.ch

Methods in com.graphhopper.routing.ch that return EdgeToEdgeRoutingAlgorithm

Modifier and Type	Method	Description
EdgeToEdgeRoutingAlgorithm	CHRoutingAlgorithmFactory.createAlgo(PMap opts)