Enum RoutingAlgorithm 

pub enum RoutingAlgorithm {
    Fastest,
    Shortest,
    Economical,
    MultiCriteria,
}

Routing algorithm variant

Variants

Fastest

Fastest route (minimum travel time)

Shortest

Shortest route (minimum distance)

Economical

Most economical (minimum cost)

MultiCriteria

Multi-criteria (weighted combination)

Trait Implementations

impl Clone for RoutingAlgorithm

fn clone(&self) -> RoutingAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RoutingAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for RoutingAlgorithm

fn eq(&self, other: &RoutingAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for RoutingAlgorithm

impl Eq for RoutingAlgorithm

impl StructuralPartialEq for RoutingAlgorithm