Struct Walk 

pub struct Walk {
    pub visited: Vec<EntityId>,
    pub stop: Stop,
    pub revisited: Vec<EntityId>,
}

The outcome of a bounded walk.

Fields

visited: Vec<EntityId>

Entities visited, in traversal order, each exactly once.

stop: Stop

Why the walk ended.

revisited: Vec<EntityId>

Entities that were reached again after being visited.

Non-empty means the graph is cyclic along the followed edges. Reported rather than silently skipped: in a spatial tree it is a defect worth surfacing to the caller.

Trait Implementations

impl Clone for Walk

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Walk

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

Formats the value using the given formatter.

impl Eq for Walk

impl PartialEq for Walk

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Walk