Struct rs_graph::linkedlistgraph::NeighIt [−][src]
pub struct NeighIt<ID>(_);
Graph iterator over edges incident with some node.
Trait Implementations
impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]Auto Trait Implementations
impl<ID> RefUnwindSafe for NeighIt<ID> where
ID: RefUnwindSafe,
impl<ID> RefUnwindSafe for NeighIt<ID> where
ID: RefUnwindSafe,
impl<ID> UnwindSafe for NeighIt<ID> where
ID: UnwindSafe,
impl<ID> UnwindSafe for NeighIt<ID> where
ID: UnwindSafe,