Show / Hide Table of Contents

Namespace Itinero.Algorithms.Contracted.Dual

Classes

BidirectionalDykstra<T>

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

DirectedGraphExtensions

Dykstra<T>

An implementation of the dykstra routing algorithm.

DykstraSourceExtensions

Contains extension methods related to dykstra sources.

FastHierarchyBuilder

FastHierarchyBuilder<T>

HierarchyBuilder

Builds a contraction hierarchy.

HierarchyBuilder<T>

Builds a contraction hierarchy.

RouterPointExtensions

Contains extension methods related to the routerpoints.

VertexToVertexAlgorithm

Structs

DykstraSource<T>

A structure representing a dykstra search source.

Delegates

Dykstra<T>.WasFoundDelegate

A signature of the was found callback function.

Back to top Built by Itinero, MIT licensed.