Package com.graphhopper.routing
package com.graphhopper.routing
-
ClassDescriptionCommon subclass for bidirectional CH algorithms.Common subclass for bidirectional algorithms.This class implements the alternative paths search using the "plateau" and partially the "penalty" method described in the following papers.Minimum number-of-moving-parts implementation of alternative route search with contraction hierarchies.Minimum number-of-moving-parts implementation of alternative route search with contraction hierarchies.This class implements the A* algorithm according to http://en.wikipedia.org/wiki/A*_search_algorithmThis class implements a bidirectional A* algorithm.Builds a
Pathfrom the two fwd- and bwd-shortest path tree entries of a bidirectional searchImplements a single source shortest path algorithm http://en.wikipedia.org/wiki/Dijkstra's_algorithmUses 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.Calculates best path in bidirectional way.A simple dijkstra tuned to perform multiple one to many queries with the same source and different target nodes more efficiently thanDijkstra.This class is used to determine the pairs of edges that go into/out of a node of the routing graph.This class calculates instructions from the edges in a Path.This class represents the result of a shortest path calculation.The callback used in forEveryEdge.Implementations of this class allow repeatedly calculating paths for different start/target nodes and edge restrictionsImplementation of calculating a route with one or more round trip (route with identical start and end).This class contains various parameters that control the behavior ofRouter.Calculates the shortest path from the specified node ids.This interface manages RoutingAlgorithm creation.A simple factory creating normal algorithms (RoutingAlgorithm) without preparation.This class is used to create the shortest-path-tree from linked entities.The methods here can be used to calculate routes with or without via points and implement possible restrictions like snap preventions, headings and curbsides.