Struct Bfs 

pub struct Bfs {
    pub size_lb: usize,
    pub size_ub: usize,
    /* private fields */
}

A breath-first traversal for Tree.

Fields

size_lb: usize

size_ub: usize

Trait Implementations

impl Clone for Bfs

fn clone(&self) -> Bfs

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Bfs

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

Formats the value using the given formatter.

impl TraversalMut for Bfs

type Item = DfsNodeData

fn new<N, const K: usize>(tree: &Tree<N, K>, root: TreeIndex) -> Bfs

Creates a new traversal over the given tree starting at the given root.

fn skip_subtree(&mut self)

Alters the iteration such that the subtree of the current node is skipped.

fn next<N, const K: usize>(&mut self, tree: &Tree<N, K>) -> Option<DfsNodeData>

Returns the next node in this traversal together with the nodes’s depth in the tree, or None if the traversal is done.

fn size_hint(&self) -> (usize, Option<usize>)

Provides a hint for the number of remaining nodes, see Iterator::size_hint

fn iter<N, const K: usize>( tree: &Tree<N, K>, root: TreeIndex, ) -> TraversalIter<'_, Self, N, K>

where Self: Sized,

Creates a new iterator using this traversal pattern. The iterator keeps a reference to the tree, inhibiting mutual access to it during the iteration.