Struct BfsVisit 

pub struct BfsVisit {
    pub vid: VertexId,
    pub pred: Option<VertexId>,
    pub succ: Option<VertexId>,
    pub rank: usize,
    pub dist: usize,
}

What a breadth-first search visitor sees each time a vertex is visited (the arguments of igraph’s igraph_bfshandler_t).

Fields

vid: VertexId

The vertex being visited.

pred: Option<VertexId>

The vertex visited just before, or None if vid is the root of a search tree.

succ: Option<VertexId>

The vertex that will be visited next, or None if vid is the last vertex of its search tree.

rank: usize

The rank of vid, i.e. its position in the visiting order (from 0).

dist: usize

The distance (number of hops) of vid from the root of its search tree.

Trait Implementations

impl Clone for BfsVisit

fn clone(&self) -> BfsVisit

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BfsVisit

impl Debug for BfsVisit

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

Formats the value using the given formatter.

impl Eq for BfsVisit

impl Hash for BfsVisit

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 BfsVisit

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