Uses of Class
com.graphhopper.routing.AbstractRoutingAlgorithm

Packages that use AbstractRoutingAlgorithm

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

Uses of AbstractRoutingAlgorithm in com.graphhopper.isochrone.algorithm

Subclasses of AbstractRoutingAlgorithm in com.graphhopper.isochrone.algorithm

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

Uses of AbstractRoutingAlgorithm in com.graphhopper.routing

Subclasses of AbstractRoutingAlgorithm in com.graphhopper.routing

Modifier and Type	Class	Description
class	AStar	This class implements the A* algorithm according to http://en.wikipedia.org/wiki/A*_search_algorithm
class	Dijkstra	Implements a single source shortest path algorithm http://en.wikipedia.org/wiki/Dijkstra's_algorithm
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.