Namespace Itinero.Algorithms.Default.EdgeBased
Classes
|
An implementation of the bi-directional dykstra algorithm. |
|
An implementation of the bi-directional dykstra algorithm. |
|
An implementation of a directed edge-based dykstra routing algorithm. |
|
DirectedDykstraSourceExtensions Contains extension methods related to dykstra sources. |
|
An algorithm to calculate many-to-many directed routes. |
|
An algorithm to calculate many-to-many directed weights. |
|
An algorithm to calculate one-to-many directed routes. |
|
An algorithm to calculate one-to-many directed weights. |
|
A directed sequence router. |
|
An implementation of the dykstra routing algorithm. |
|
An implementation of the dykstra routing algorithm. |
|
An algorithm to calculate many-to-many weights/paths. |
|
An algorithm to calculate many-to-many weights/paths. |
|
An algorithm to calculate one-to-many weights/paths. |
|
An algorithm to calculate one-to-many weights/paths. |
|
Contains extension methods related to the routerpoints. |
Structs
|
A structure representing a dykstra search source. |
Delegates
|
DirectedDykstra<T>.WasFoundDelegate A signature of the was found callback function. |