Trait bigraph::traversal::TraversalNeighborStrategy

pub trait TraversalNeighborStrategy<'a, Graph> where
    Graph: GraphBase,
    <Self::Iterator as Iterator>::Item == <Graph as GraphBase>::NodeIndex, {
    type Iterator: Iterator;
    fn neighbor_iterator(
        graph: &'a Graph, 
        node: <Graph as GraphBase>::NodeIndex
    ) -> Self::Iterator;
}

Associated Types

type Iterator: Iterator

Loading content...

Required methods

fn neighbor_iterator(
    graph: &'a Graph,
    node: <Graph as GraphBase>::NodeIndex
) -> Self::Iterator

Loading content...

Implementors

impl<'a, Graph> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy where
    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

impl<'a, Graph> TraversalNeighborStrategy<'a, Graph> for ForwardNeighborStrategy where
    Graph: NavigableGraph<'a>, 

type Iterator = Map<<<Graph as NavigableGraph<'a>>::OutNeighbors 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
) -> <ForwardNeighborStrategy as TraversalNeighborStrategy<'a, Graph>>::Iterator

impl<'a, Graph> TraversalNeighborStrategy<'a, Graph> for UndirectedNeighborStrategy where
    Graph: NavigableGraph<'a>, 

type Iterator = Map<Chain<<<Graph as NavigableGraph<'a>>::OutNeighbors as IntoIterator>::IntoIter, <<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
) -> <UndirectedNeighborStrategy as TraversalNeighborStrategy<'a, Graph>>::Iterator

Loading content...