Struct DfsResult 

pub struct DfsResult {
    pub order: Vec<VertexId>,
    pub order_out: Vec<VertexId>,
    pub parents: Vec<Option<VertexId>>,
    pub dist: Vec<Option<usize>>,
    pub stopped: bool,
}

Results of a depth-first search (Graph::dfs, Graph::dfs_with).

Fields

order: Vec<VertexId>

The vertices in the order they were discovered (pre-order).

order_out: Vec<VertexId>

The vertices in the order their subtrees were completed (post-order). If the search was stopped early, it may be shorter than order.

parents: Vec<Option<VertexId>>

The parent of each vertex in the DFS forest: None for the roots of the search trees and for unvisited vertices.

dist: Vec<Option<usize>>

The depth of each vertex in its DFS tree (the number of tree edges between it and the root of its tree), None if not visited. Unlike the raw output of igraph_dfs, it stays exact after a restart with DfsOptions::unreachable (see the module docs).

stopped: bool

true if the visitor closure returned ControlFlow::Break.

Implementations

impl DfsResult

pub fn is_visited(&self, v: VertexId) -> bool

Whether vertex v was discovered by the search.

pub fn path_to(&self, v: VertexId) -> Option<Vec<VertexId>>

The path of the DFS forest from the root of v’s tree down to v, or None if v was not visited.

Trait Implementations

impl Clone for DfsResult

fn clone(&self) -> DfsResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DfsResult

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

Formats the value using the given formatter.

impl Eq for DfsResult

impl PartialEq for DfsResult

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