Show / Hide Table of Contents

Namespace Itinero.Algorithms.Default

Classes

BidirectionalDykstra

An implementation of the bi-directional dykstra algorithm.

BidirectionalDykstra<T>

An implementation of the bi-directional dykstra algorithm.

Dykstra

A default implementation of the generic dykstra 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.

Delegates

Dykstra<T>.WasFoundDelegate

The was found delegate.

Back to top Built by Itinero, MIT licensed.