pub trait Edges<I, D> where
I: Identity, {
fn next_edge(&self, previous_edge_index: Option<usize>) -> Option<Edge<I, D>>;
fn edges(&self) -> EdgeIterator<'_, I, D, Self>ⓘNotable traits for EdgeIterator<'a, I, E, Ed>impl<'a, I, E, Ed> Iterator for EdgeIterator<'a, I, E, Ed> where
I: Identity,
Ed: Edges<I, E>, type Item = Edge<I, E>;
where
Self: Sized,
{ ... }
}Expand description
Be able to derive a set of identifiers from a given item. Semantically this is Get “children” but not all graph operations are parent-child.
Given a type, find the next set of identities I that I need to traverse Metadata may also be optionally returned via the E value
Required Methods
Provided Methods
fn edges(&self) -> EdgeIterator<'_, I, D, Self>ⓘNotable traits for EdgeIterator<'a, I, E, Ed>impl<'a, I, E, Ed> Iterator for EdgeIterator<'a, I, E, Ed> where
I: Identity,
Ed: Edges<I, E>, type Item = Edge<I, E>; where
Self: Sized,
I: Identity,
Ed: Edges<I, E>, type Item = Edge<I, E>;