Struct BfsTree 

pub struct BfsTree {
    pub order: Vec<VertexId>,
    pub distances: Vec<Option<u32>>,
    pub parents: Vec<Option<VertexId>>,
}

Result of a multi-output BFS scan from a single root. Returned by bfs_tree.

Fields

order: Vec<VertexId>

Vertices reachable from the root, in BFS visit order.

distances: Vec<Option<u32>>

distances[v] == Some(d) if v is reachable from the root in d edges (d == 0 for the root); None if unreachable.

parents: Vec<Option<VertexId>>

parents[v] == Some(p) if v was BFS-discovered via p; None for the root and for unreachable vertices.

Trait Implementations

impl Clone for BfsTree

fn clone(&self) -> BfsTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BfsTree

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

Formats the value using the given formatter.

impl PartialEq for BfsTree

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

impl StructuralPartialEq for BfsTree