Uses of Interface
com.graphhopper.routing.BidirRoutingAlgorithm

Packages that use BidirRoutingAlgorithm

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

Uses of BidirRoutingAlgorithm in com.graphhopper.routing

Classes in com.graphhopper.routing that implement BidirRoutingAlgorithm

Modifier and Type	Class and Description
class	AbstractBidirAlgo
class	AbstractBidirCHAlgo Common subclass for bidirectional CH algorithms.
class	AbstractBidirectionEdgeCHNoSOD
class	AbstractNonCHBidirAlgo Common subclass for bidirectional algorithms.
static class	AlternativeRoute.AlternativeBidirSearch Helper class to find alternatives and alternatives for round trip.
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.

Uses of BidirRoutingAlgorithm in com.graphhopper.routing.ch

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

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