Struct DfsTree 

pub struct DfsTree {
    pub order: Vec<VertexId>,
    pub order_out: Vec<VertexId>,
    pub parents: Vec<Option<VertexId>>,
    pub dist: Vec<Option<u32>>,
}

Result of a multi-output DFS scan from a single root. Returned by dfs_tree.

Fields

order: Vec<VertexId>

Vertices reachable from the root, in DFS pre-order (discovery order).

order_out: Vec<VertexId>

Vertices in DFS post-order (finish order).

parents: Vec<Option<VertexId>>

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

dist: Vec<Option<u32>>

dist[v] == Some(d) if v is reachable from the root at DFS-tree depth d (0 for root); None if unreachable.

Trait Implementations

impl Clone for DfsTree

fn clone(&self) -> DfsTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DfsTree

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

Formats the value using the given formatter.

impl PartialEq for DfsTree

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

impl StructuralPartialEq for DfsTree