Trait TreeTraversal

pub trait TreeTraversal<T> {
    // Required methods
    fn dfs(&self) -> Descendants<'_, T>;
    fn bfs(&self) -> BreadthFirstTraversal<'_, T> ;
    fn left_boundary(&self) -> impl Iterator<Item = Self>;
    fn right_boundary(&self) -> impl Iterator<Item = Self>;
}

Extension trait adding traversal algorithms on trees.

Required Methods

fn dfs(&self) -> Descendants<'_, T>

Iterates over descendants of node in depth-first order.

fn bfs(&self) -> BreadthFirstTraversal<'_, T>

Iterates over descendants of node in breadth-first order.

fn left_boundary(&self) -> impl Iterator<Item = Self>

Iterates over left boundary of node.

fn right_boundary(&self) -> impl Iterator<Item = Self>

Iterates over right boundary of node.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<'a, T: 'a> TreeTraversal<T> for NodeRef<'a, T>

fn dfs(&self) -> Descendants<'a, T>

Uses the built-in traversal algorithm, which is depth-first, though that is not documented: https://github.com/rust-scraper/ego-tree/issues/38

fn bfs(&self) -> BreadthFirstTraversal<'a, T>

Implements the standard BFS algorithm using a queue.

fn left_boundary(&self) -> impl Iterator<Item = Self>

fn right_boundary(&self) -> impl Iterator<Item = Self>

Implementors