Struct BfsSimpleResult 

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

Results of Graph::bfs_simple.

Fields

order: Vec<VertexId>

The visited vertices, in visiting order (only the ones reachable from the root).

layers: Vec<usize>

Layer boundaries: the vertices at distance i from the root are order[layers[i]..layers[i + 1]]. It has one more element than the number of layers; the last one is order.len().

parents: Vec<Option<VertexId>>

The parent of each vertex in the BFS tree: None for the root and for vertices that were not reached.

Implementations

impl BfsSimpleResult

pub fn num_layers(&self) -> usize

Number of distance layers (the eccentricity of the root plus one).

pub fn layer(&self, i: usize) -> &[VertexId]

The vertices at distance i from the root (empty if i is too large).

pub fn iter_layers(&self) -> impl Iterator<Item = &[VertexId]> + '_

Iterates over the distance layers, from the root outwards.

Trait Implementations

impl Clone for BfsSimpleResult

fn clone(&self) -> BfsSimpleResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BfsSimpleResult

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

Formats the value using the given formatter.

impl Eq for BfsSimpleResult

impl PartialEq for BfsSimpleResult

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