Enum DfsEvent 

pub enum DfsEvent {
    Discover {
        vid: VertexId,
        dist: usize,
    },
    Finish {
        vid: VertexId,
        dist: usize,
    },
}

An event reported to a depth-first search visitor (Graph::dfs_with).

igraph has two DFS callbacks: one when a vertex is discovered (in_callback) and one when its subtree is finished (out_callback). A single Rust closure receives both, as the two variants of this enum.

Variants

Discover

A vertex has just been discovered (pre-order).

Fields

vid: VertexId

The discovered vertex.

dist: usize

Its distance (depth) from the root of its search tree.

Finish

The whole subtree of a vertex has been explored (post-order).

Fields

vid: VertexId

The finished vertex.

dist: usize

Its distance (depth) from the root of its search tree: the same value as in the matching Discover event (the raw C callback receives one less).

Implementations

impl DfsEvent

pub fn vid(&self) -> VertexId

The vertex the event is about.

pub fn dist(&self) -> usize

The depth of the vertex in its search tree.

Trait Implementations

impl Clone for DfsEvent

fn clone(&self) -> DfsEvent

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for DfsEvent

impl Debug for DfsEvent

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

Formats the value using the given formatter.

impl Eq for DfsEvent

impl Hash for DfsEvent

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for DfsEvent

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