Struct NodeMutRef 

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

Fields

id: NodeId

Implementations

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

pub fn data(&mut self) -> &mut NodeData

Trait Implementations

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

type Target = NodeData

The resulting type after dereferencing.

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

Dereferences the value.

impl<NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> DerefMut for NodeMutRef<'_, NodeId, EdgeId, NodeData, EdgeData>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'graph, NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> NodeMut<'graph> for NodeMutRef<'graph, NodeId, EdgeId, NodeData, EdgeData>

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

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

fn id(&self) -> NodeId

Returns this node identifier.

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

Returns the backing graph reference for this node.

fn edge_ids(&self) -> &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 add_edge_id(&mut self, edge: EdgeId)

Registers an edge as incident to this node.

fn remove_edge_id(&mut self, edge: EdgeId)

Removes an edge from this node’s incident edge set.

fn as_ref<'a>(&'a mut self) -> <Self::Graph as Graph>::Node<'a>

where 'graph: 'a,

Returns a “weaker” immutable view of this mutable node handle.