[][src]Struct petgraph::stable_graph::Neighbors

pub struct Neighbors<'a, E: 'a, Ix: 'a = DefaultIx> { /* fields omitted */ }

Iterator over the neighbors of a node.

Iterator element type is NodeIndex.

Methods

impl<'a, E, Ix> Neighbors<'a, E, Ix> where
    Ix: IndexType
[src]

pub fn detach(&self) -> WalkNeighbors<Ix>[src]

Return a “walker” object that can be used to step through the neighbors and edges from the origin node.

Note: The walker does not borrow from the graph, this is to allow mixing edge walking with mutating the graph's weights.

Trait Implementations

impl<'a, E, Ix> Iterator for Neighbors<'a, E, Ix> where
    Ix: IndexType
[src]

type Item = NodeIndex<Ix>

The type of the elements being iterated over.

Auto Trait Implementations

impl<'a, E, Ix> RefUnwindSafe for Neighbors<'a, E, Ix> where
    E: RefUnwindSafe,
    Ix: RefUnwindSafe

impl<'a, E, Ix> Send for Neighbors<'a, E, Ix> where
    E: Sync,
    Ix: Send + Sync

impl<'a, E, Ix> Sync for Neighbors<'a, E, Ix> where
    E: Sync,
    Ix: Sync

impl<'a, E, Ix> Unpin for Neighbors<'a, E, Ix> where
    Ix: Unpin

impl<'a, E, Ix> UnwindSafe for Neighbors<'a, E, Ix> where
    E: RefUnwindSafe,
    Ix: RefUnwindSafe + UnwindSafe

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.