Namespace Itinero.Optimization.Tours
Classes
|
Enumerates all pairs in an IRoute. |
|
An enumerable of all possible permutations of a given sequence of objects. |
|
Implements the Shimon Even variant of the Steinhaus–Johnson–Trotter algorithm. https://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup |
|
a route or a sequence of customers. |
|
Contains tour extensions. |
|
Enumerates all triples in an IRoute. |
Structs
|
Represents a pair (or a connection between two adjacent customers). |
|
Represents a triple (or a connection between three adjacent customers). |
Interfaces
|
Abstract representation of a route or a sequence of customers. |