Struct DataEdge 

#[non_exhaustive]
pub struct DataEdge {
    pub from: u32,
    pub to: u32,
    pub kind: EdgeKind,
}

Directed edge between two GraphNodes.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

from: u32

Source node id.

to: u32

Destination node id.

kind: EdgeKind

Kind of the dependency.

Implementations

impl DataEdge

pub fn new(from: u32, to: u32, kind: EdgeKind) -> Self

Construct a DataEdge from explicit fields (V7-EXT-026).

Trait Implementations

impl Clone for DataEdge

fn clone(&self) -> DataEdge

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DataEdge

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

Formats the value using the given formatter.

impl PartialEq for DataEdge

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

impl StructuralPartialEq for DataEdge