Uses of Class
com.graphhopper.routing.AbstractBidirAlgo

Packages that use AbstractBidirAlgo

Package	Description
com.graphhopper.routing

Uses of AbstractBidirAlgo in com.graphhopper.routing

Subclasses of AbstractBidirAlgo in com.graphhopper.routing

Modifier and Type	Class	Description
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	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.