Struct MinimalPartialPaths 

#[non_exhaustive]
pub struct MinimalPartialPaths<'a> {
    pub paths: Vec<PartialPath<'a>>,
    pub exhausted: Vec<NodeId>,
}

The walks a search found, and the endpoints whose search ran out of work.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

paths: Vec<PartialPath<'a>>

The walks found, endpoint by endpoint.

exhausted: Vec<NodeId>

The endpoints whose search stopped with edges left to try.

Trait Implementations

impl<'a> Clone for MinimalPartialPaths<'a>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for MinimalPartialPaths<'a>

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

Formats the value using the given formatter.

impl<'a> Default for MinimalPartialPaths<'a>

fn default() -> Self

Returns the “default value” for a type.

impl<'a> Eq for MinimalPartialPaths<'a>

impl<'a> PartialEq for MinimalPartialPaths<'a>

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

Equality operator ==.

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

Inequality operator !=.

impl<'a> StructuralPartialEq for MinimalPartialPaths<'a>