Struct TraversalComplexity 

pub struct TraversalComplexity {
    pub time_complexity_class: String,
    pub space_complexity_class: String,
    pub expected_iterations: usize,
}

Complexity analysis for graph algorithms

Fields

time_complexity_class: String

BFS/DFS time complexity class

space_complexity_class: String

Space complexity class

expected_iterations: usize

Expected iterations for convergence algorithms

Trait Implementations

impl Clone for TraversalComplexity

fn clone(&self) -> TraversalComplexity

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TraversalComplexity

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

Formats the value using the given formatter.

impl Default for TraversalComplexity

fn default() -> TraversalComplexity

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TraversalComplexity

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for TraversalComplexity

fn eq(&self, other: &TraversalComplexity) -> 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 Serialize for TraversalComplexity

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 TraversalComplexity