Struct Edge

pub struct Edge<T> {
    pub id: EdgeID,
    pub from: NodeID,
    pub to: NodeID,
    pub data: T,
}

A struct representing an edge in the graph.

Contains an EdgeID which is a key to the edge in the slotmap, and two NodeIDs which are the nodes the edge connects (from & to). An edge can also have “data”, which could be anything or nothing; for example the weight of the connection or a struct or enum representing something else.

Why is there no “EdgeTrait”?

The Edge struct is very simple and doesn’t need a trait. It’s just a struct with an ID, two node IDs, and some data. If you want to add more functionality or data to the edge you can probably just add it to the data field, or add an edge as a field to your custom type.

Fields

id: EdgeID

from: NodeID

to: NodeID

data: T

Implementations

impl<T> Edge<T>

pub fn new(id: EdgeID, from: NodeID, to: NodeID, data: T) -> Edge<T>

Trait Implementations

impl<T: Clone> Clone for Edge<T>

fn clone(&self) -> Edge<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Edge<T>

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

Formats the value using the given formatter.

impl<T: Hash> Hash for Edge<T>

Implements Hash for Edge so only the ID is used for hashing.

fn hash<H: Hasher>(&self, ra_expand_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<T> PartialEq for Edge<T>

Implements PartialEq for Edge so only the ID is used for comparison.

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