fn neighbor_iterator(graph: &'a Graph, node: Graph::NodeIndex) -> Self::Iterator
impl<'a, Graph: NavigableGraph<'a>> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy
[src]type Iterator = NeighborsIntoNodes<Graph::NodeIndex, Graph::EdgeIndex, Graph::InNeighbors>
fn neighbor_iterator(graph: &'a Graph, node: Graph::NodeIndex) -> Self::Iterator
[src]impl<'a, Graph: NavigableGraph<'a>> TraversalNeighborStrategy<'a, Graph> for ForwardNeighborStrategy
[src]type Iterator = NeighborsIntoNodes<Graph::NodeIndex, Graph::EdgeIndex, Graph::OutNeighbors>
fn neighbor_iterator(graph: &'a Graph, node: Graph::NodeIndex) -> Self::Iterator
[src]impl<'a, Graph: NavigableGraph<'a>> TraversalNeighborStrategy<'a, Graph> for UndirectedNeighborStrategy
[src]type Iterator = InOutNeighborsIntoNodes<Graph::NodeIndex, Graph::EdgeIndex, Graph::OutNeighbors, Graph::InNeighbors>
fn neighbor_iterator(graph: &'a Graph, node: Graph::NodeIndex) -> Self::Iterator
[src]