[][src]Struct petgraph::graph::NodeReferences

pub struct NodeReferences<'a, N: 'a, Ix: IndexType = DefaultIx> { /* fields omitted */ }

Iterator over all nodes of a graph.

Trait Implementations

impl<'a, N, Ix> DoubleEndedIterator for NodeReferences<'a, N, Ix> where
    Ix: IndexType
[src]

impl<'a, N, Ix> ExactSizeIterator for NodeReferences<'a, N, Ix> where
    Ix: IndexType
[src]

impl<'a, N, Ix> Iterator for NodeReferences<'a, N, Ix> where
    Ix: IndexType
[src]

type Item = (NodeIndex<Ix>, &'a N)

The type of the elements being iterated over.

Auto Trait Implementations

impl<'a, N, Ix> RefUnwindSafe for NodeReferences<'a, N, Ix> where
    Ix: RefUnwindSafe,
    N: RefUnwindSafe

impl<'a, N, Ix> Send for NodeReferences<'a, N, Ix> where
    Ix: Sync,
    N: Sync

impl<'a, N, Ix> Sync for NodeReferences<'a, N, Ix> where
    Ix: Sync,
    N: Sync

impl<'a, N, Ix> Unpin for NodeReferences<'a, N, Ix>

impl<'a, N, Ix> UnwindSafe for NodeReferences<'a, N, Ix> where
    Ix: RefUnwindSafe,
    N: RefUnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<I> IntoIterator for I where
    I: Iterator
[src]

type Item = <I as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = I

Which kind of iterator are we turning this into?

impl<I> IteratorRandom for I where
    I: Iterator
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.