Enum TraversalAlgorithm 

pub enum TraversalAlgorithm {
    Bfs,
    Dijkstra,
    KShortest,
}

Traversal strategy used to find confirmed paths.

Variants

Bfs

Deterministic shortest path by hop count.

Dijkstra

Deterministic shortest path by conservative edge weight.

KShortest

Deterministic bounded enumeration of loopless paths by total weight.

Trait Implementations

impl Clone for TraversalAlgorithm

fn clone(&self) -> TraversalAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for TraversalAlgorithm

impl Debug for TraversalAlgorithm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TraversalAlgorithm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for TraversalAlgorithm

impl JsonSchema for TraversalAlgorithm

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl PartialEq for TraversalAlgorithm

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for TraversalAlgorithm

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TraversalAlgorithm