Namespace Itinero.Algorithms.Contracted.EdgeBased

Classes

BidirectionalDykstra An algorithm to calculate a point-to-point route based on a contraction hierarchy.

BidirectionalDykstra<T> An algorithm to calculate a point-to-point route based on a contraction hierarchy.

DirectedDynamicGraphExtensions Contains contraction related extension methods related to the directed dynamic graph.

DirectedGraphBuilder Builds a directed graph from a regular graph.

DirectedGraphBuilder<T> Builds a directed graph from a regular graph.

Dykstra An implementation of the dykstra routing algorithm.

Dykstra<T> An implementation of the dykstra routing algorithm.

EdgeDifferencePriorityCalculator A priority calculator.

EdgeDifferencePriorityCalculator<T> A priority calculator.

EdgePathExtensions Extension method for the edge path.

HierarchyBuilder Builds a contraction hierarchy.

HierarchyBuilder<T> Builds a contraction hierarchy.

ManyToManyBidirectionalDykstra An algorithm to calculate many-to-many weights based on a contraction hierarchy.

ManyToManyBidirectionalDykstra<T> An algorithm to calculate many-to-many weights based on a contraction hierarchy.

ManyToManyWeightsBidirectionalDykstra An algorithm to calculate many-to-many weights based on a contraction hierarchy.

ManyToManyWeightsBidirectionalDykstra<T> An algorithm to calculate many-to-many weights based on a contraction hierarchy.

Interfaces

IPriorityCalculator A vertex priority calculator.