Package com.graphhopper.routing

Interface Summary

Interface	Description
Path.EdgeVisitor	The callback used in forEveryEdge.
RecalculationHook	An interface with which you can trigger a heuristic change of the underlying algorithm.
RoutingAlgorithm	Calculates the shortest path from the specified node ids.
RoutingAlgorithmFactory	This interface manages RoutingAlgorithm creation.
RoutingAlgorithmFactoryDecorator

Class Summary

Class	Description
AbstractBidirAlgo	Common subclass for bidirectional algorithms.
AbstractRoutingAlgorithm
AlgorithmOptions	The algorithm options.
AlgorithmOptions.Builder
AlternativeRoute	This class implements the alternative paths search using the "plateau" and partially the "penalty" method described in the following papers.
AlternativeRoute.AlternativeBidirSearch	Helper class to find alternatives and alternatives for round trip.
AlternativeRoute.AlternativeInfo
AlternativeRoute.PlateauInfo
AStar	This class implements the A* algorithm according to http://en.wikipedia.org/wiki/A*_search_algorithm
AStar.AStarEntry
AStarBidirection	This class implements a bidirectional A* algorithm.
AStarBidirectionCH
Dijkstra	Implements a single source shortest path algorithm http://en.wikipedia.org/wiki/Dijkstra's_algorithm
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.
DijkstraBidirectionCHNoSOD
DijkstraBidirectionRef	Calculates best path in bidirectional way.
DijkstraOneToMany	A simple dijkstra tuned to perform one to many queries more efficient than Dijkstra.
InstructionsFromEdges	This class calculates instructions from the edges in a Path.
Path	Stores the nodes for the found path of an algorithm.
PathBidirRef	This class creates a DijkstraPath from two Edge's resulting from a BidirectionalDijkstra
PathNative	This class creates a Path from a DijkstraOneToMany algorithm
QueryGraph	A class which is used to query the underlying graph with real GPS points.
RoutingAlgorithmFactorySimple	A simple factory creating normal algorithms (RoutingAlgorithm) without preparation.
VirtualEdgeIteratorState	Creates an edge state decoupled from a graph where nodes, pointList, etc are kept in memory.