Trait Node 

pub trait Node<'graph> {
    type Graph: Graph;

    // Required methods
    fn new(
        id: <Self::Graph as Graph>::NodeId,
        graph: &'graph Self::Graph,
    ) -> Self;
    fn id(&self) -> <Self::Graph as Graph>::NodeId;
    fn graph(&self) -> &'graph Self::Graph;
    fn edge_ids(
        &self,
    ) -> &'graph HashSet<<Self::Graph as Graph>::EdgeId, <Self::Graph as Graph>::Hasher>;
    fn edge_count(&self) -> usize;

    // Provided methods
    fn is_leaf(&self) -> bool { ... }
    fn edges(&self) -> Iter<'graph, EdgeMode, Self::Graph>  { ... }
    fn children(&self) -> Iter<'graph, ChildMode, Self::Graph>  { ... }
    fn parents(&self) -> Iter<'graph, ParentMode, Self::Graph>  { ... }
}

Required Associated Types

type Graph: Graph

Required Methods

fn new(id: <Self::Graph as Graph>::NodeId, graph: &'graph Self::Graph) -> Self

fn id(&self) -> <Self::Graph as Graph>::NodeId

Returns this node identifier.

fn graph(&self) -> &'graph Self::Graph

Returns the backing graph reference for this node.

fn edge_ids( &self, ) -> &'graph HashSet<<Self::Graph as Graph>::EdgeId, <Self::Graph as Graph>::Hasher>

Retrieve the ids of all edges incident to this node.

fn edge_count(&self) -> usize

Returns the number of incident edges for this node.

Provided Methods

fn is_leaf(&self) -> bool

Returns true if this node has no connected edges.

fn edges(&self) -> Iter<'graph, EdgeMode, Self::Graph>

Iterates over all incident edges.

fn children(&self) -> Iter<'graph, ChildMode, Self::Graph>

Iterates over child relationships for outgoing edges.

fn parents(&self) -> Iter<'graph, ParentMode, Self::Graph>

Iterates over parent relationships for incoming edges.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl<'graph, NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> Node<'graph> for NodeRef<'graph, NodeId, EdgeId, NodeData, EdgeData>

type Graph = OwningGraph<NodeId, EdgeId, NodeData, EdgeData>