Struct Node

pub struct Node<T> {
    pub id: NodeID,
    pub data: T,
    pub connections: Vec<EdgeID>,
}

A struct representing a node/vertex in the graph.

Has a generic data field and a list of EdgeIDs.

A NodeID is a key to the node in the slotmap.

Why is there no “NodeTrait”?

The Node struct is very simple and doesn’t need a trait. If you want to add more functionality or data to the Node you can probably just add it to the data field, or add a node as a field to your custom type.

Fields

id: NodeID

data: T

connections: Vec<EdgeID>

Implementations

impl<T> Node<T>

pub fn new(id: NodeID, data: T) -> Node<T>

pub fn add_connection(&mut self, edge: EdgeID)

Trait Implementations

impl<T: Debug> Debug for Node<T>

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

Formats the value using the given formatter.

impl<T: Hash> Hash for Node<T>

Implements Hash for Node 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 Node<T>

Implements PartialEQ for Node 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.