Trait GraphEdgesEnumerableInterface 

pub trait GraphEdgesEnumerableInterface: GraphNodesNominalInterface + GraphEdgesNominalInterface {
    // Required method
    fn edges<'a, 'b>(
        &'a self,
    ) -> Box<dyn Iterator<Item = (<Self::EdgeHandle as HasId>::Id, &'a Self::EdgeHandle)> + 'b>
       where 'a: 'b;

    // Provided method
    fn nedges(&self) -> usize { ... }
}

Graph edges of which is possible to enumerate.

Required Methods

fn edges<'a, 'b>( &'a self, ) -> Box<dyn Iterator<Item = (<Self::EdgeHandle as HasId>::Id, &'a Self::EdgeHandle)> + 'b>

where 'a: 'b,

Iterate over all edges.

Provided Methods

fn nedges(&self) -> usize

Number of edges. Size of the graph.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors

impl<NodeId, EdgeId, Kind> GraphEdgesEnumerableInterface for CellNodeFactory<NodeId, EdgeId, Kind>

where NodeId: IdentityInterface, EdgeId: IdentityInterface + IdentityGenerableInterface, Kind: NodeKindInterface,

impl<NodeId, EdgeId, Kind> GraphEdgesEnumerableInterface for NodeFactory<NodeId, EdgeId, Kind>

where EdgeId: IdentityInterface + IdentityGenerableInterface, NodeId: IdentityInterface, Kind: NodeKindInterface,