Struct NodeRef 

pub struct NodeRef<'graph, NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> {
    pub id: NodeId,
    /* private fields */
}

Fields

id: NodeId

Implementations

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

pub fn data(&self) -> &'graph NodeData

Trait Implementations

impl<NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> Deref for NodeRef<'_, NodeId, EdgeId, NodeData, EdgeData>

type Target = NodeData

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

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

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

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

fn id(&self) -> 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<EdgeId, RandomState>

Retrieve the ids of all edges incident to this node.

fn edge_count(&self) -> usize

Returns the number of incident edges for this node.

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.