Struct BfsSimple 

pub struct BfsSimple {
    pub order: Vec<VertexId>,
    pub layers: Vec<usize>,
    pub parents: Vec<Option<VertexId>>,
}

Result of bfs_simple.

Fields

order: Vec<VertexId>

Vertices visited during the traversal, in BFS order.

layers: Vec<usize>

Layer boundary indices into order. Vertices at distance d from the root are order[layers[d]..layers[d+1]]. The length is max_distance + 2.

parents: Vec<Option<VertexId>>

parents[v] == Some(p) if vertex v was discovered via p; parents[root] == None (root has no parent). parents[v] == None for unreachable vertices as well. To distinguish root from unreachable, check order[0] == v.

Trait Implementations

impl Clone for BfsSimple

fn clone(&self) -> BfsSimple

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BfsSimple

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

Formats the value using the given formatter.

impl PartialEq for BfsSimple

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

impl StructuralPartialEq for BfsSimple