Namespace Itinero.Algorithms.Contracted

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.

BidirectionalDykstraExtensions Contains extension methods related to contracted bidirectional dykstra.

DirectedGraphBuilder Builds a directed graph from a regular graph.

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

DirectedGraphExtensions

DirectedMetaGraphExtensions Directed graph extensions assuming it contains contracted data.

Dykstra An implementation of the dykstra routing algorithm.

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

EdgeDifferencePriorityCalculator A priority calculator.

FastHierarchyBuilder

FastHierarchyBuilder<T>

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.

PathTreeExtensions Contains extension methods related to path tree.

Interfaces

IPriorityCalculator A vertex priority calculator.