Show / Hide Table of Contents

Namespace Itinero.Algorithms.Default.EdgeBased

Classes

BidirectionalDykstra

An implementation of the bi-directional dykstra algorithm.

BidirectionalDykstra<T>

An implementation of the bi-directional dykstra algorithm.

DirectedDykstra<T>

An implementation of a directed edge-based dykstra routing algorithm.

DirectedDykstraSourceExtensions

Contains extension methods related to dykstra sources.

DirectedManyToMany<T>

An algorithm to calculate many-to-many directed routes.

DirectedManyToManyWeights<T>

An algorithm to calculate many-to-many directed weights.

DirectedOneToMany<T>

An algorithm to calculate one-to-many directed routes.

DirectedOneToManyWeights<T>

An algorithm to calculate one-to-many directed weights.

DirectedSequenceRouter

A directed sequence router.

Dykstra

An implementation of the dykstra routing algorithm.

Dykstra<T>

An implementation of the dykstra routing algorithm.

ManyToMany

An algorithm to calculate many-to-many weights/paths.

ManyToMany<T>

An algorithm to calculate many-to-many weights/paths.

OneToMany

An algorithm to calculate one-to-many weights/paths.

OneToMany<T>

An algorithm to calculate one-to-many weights/paths.

RouterPointExtensions

Contains extension methods related to the routerpoints.

Structs

DirectedDykstraSource<T>

A structure representing a dykstra search source.

Delegates

DirectedDykstra<T>.WasFoundDelegate

A signature of the was found callback function.

Back to top Built by Itinero, MIT licensed.