Namespace Itinero.Algorithms.Contracted.Dual
Classes
|
An algorithm to calculate a point-to-point route based on a contraction hierarchy. |
|
|
|
An implementation of the dykstra routing algorithm. |
|
Contains extension methods related to dykstra sources. |
|
|
|
|
|
Builds a contraction hierarchy. |
|
Builds a contraction hierarchy. |
|
Contains extension methods related to the routerpoints. |
|
|
Structs
|
A structure representing a dykstra search source. |
Delegates
|
A signature of the was found callback function. |