Trait traitgraph::traversal::TraversalNeighborStrategy

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

Associated Types

type Iterator: Iterator<Item = <Graph as GraphBase>::NodeIndex>

Loading content...

Required methods

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

Loading content...

Implementors

impl<'a, Graph: NavigableGraph<'a>> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy

type Iterator = NeighborsIntoNodes<Graph::NodeIndex, Graph::EdgeIndex, Graph::InNeighbors>

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

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

type Iterator = NeighborsIntoNodes<Graph::NodeIndex, Graph::EdgeIndex, Graph::OutNeighbors>

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

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

type Iterator = InOutNeighborsIntoNodes<Graph::NodeIndex, Graph::EdgeIndex, Graph::OutNeighbors, Graph::InNeighbors>

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

Loading content...