[−][src]Struct bigraph::traversal::BackwardNeighborStrategy
Trait Implementations
impl<'a, Graph> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy where
Graph: NavigableGraph<'a>,
[src]
Graph: NavigableGraph<'a>,
type Iterator = Map<<<Graph as NavigableGraph<'a>>::InNeighbors as IntoIterator>::IntoIter, fn(Neighbor<<Graph as GraphBase>::NodeIndex, <Graph as GraphBase>::EdgeIndex>) -> <Graph as GraphBase>::NodeIndex>
fn neighbor_iterator(
graph: &'a Graph,
node: <Graph as GraphBase>::NodeIndex
) -> <BackwardNeighborStrategy as TraversalNeighborStrategy<'a, Graph>>::Iterator
[src]
graph: &'a Graph,
node: <Graph as GraphBase>::NodeIndex
) -> <BackwardNeighborStrategy as TraversalNeighborStrategy<'a, Graph>>::Iterator
Auto Trait Implementations
impl RefUnwindSafe for BackwardNeighborStrategy
impl Send for BackwardNeighborStrategy
impl Sync for BackwardNeighborStrategy
impl Unpin for BackwardNeighborStrategy
impl UnwindSafe for BackwardNeighborStrategy
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,