Trait graphs_tools::abs::graph::prelude::GraphNodesEnumerableInterface

pub trait GraphNodesEnumerableInterface where
    Self: GraphNodesNominalInterface, {
    fn nodes<'a, 'b>(
        &'a self
    ) -> Box<dyn Iterator<Item = (<<Self as GraphNodesNominalInterface>::NodeHandle as HasId>::Id, &<Self as GraphNodesNominalInterface>::NodeHandle)> + 'b>
    where
        'a: 'b;

    fn nnodes(&self) -> usize { ... }
}

Graph nodes of which is possible to enumerate.

Required Methods

fn nodes<'a, 'b>(
    &'a self
) -> Box<dyn Iterator<Item = (<<Self as GraphNodesNominalInterface>::NodeHandle as HasId>::Id, &<Self as GraphNodesNominalInterface>::NodeHandle)> + 'b> where
    'a: 'b, 

Iterate over all nodes.

Provided Methods

fn nnodes(&self) -> usize

Number of nodes. Order of the graph.

Implementors

impl<NodeId, EdgeId, Kind> GraphNodesEnumerableInterface for CellNodeFactory<NodeId, EdgeId, Kind> where
    NodeId: IdentityInterface,
    EdgeId: IdentityInterface + IdentityGenerableInterface,
    Kind: NodeKindInterface, 

impl<NodeId, EdgeId, Kind> GraphNodesEnumerableInterface for NodeFactory<NodeId, EdgeId, Kind> where
    NodeId: IdentityInterface,
    EdgeId: IdentityInterface + IdentityGenerableInterface,
    Kind: NodeKindInterface,