Trait traitgraph_algo::traversal::TraversalNeighborStrategy

source · 
pub trait TraversalNeighborStrategy<'a, Graph: GraphBase> {
    type Iterator: Iterator<Item = Neighbor<Graph::NodeIndex, Graph::EdgeIndex>>;
    type EdgeNeighborIterator: Iterator<Item = Graph::NodeIndex>;

    // Required methods
    fn neighbor_iterator(
        graph: &'a Graph,
        node: Graph::NodeIndex
    ) -> Self::Iterator;
    fn edge_neighbor_iterator(
        graph: &'a Graph,
        edge: Graph::EdgeIndex
    ) -> Self::EdgeNeighborIterator;
}
Expand description

A type that defines the strategy for computing the neighborhood of a node or edge, i.e. forward, backward or undirected.

Required Associated Types§

source

type Iterator: Iterator<Item = Neighbor<Graph::NodeIndex, Graph::EdgeIndex>>

The iterator type used to iterate over the neighbors of a node.

source

type EdgeNeighborIterator: Iterator<Item = Graph::NodeIndex>

The iterator type used to iterate over the neighbors of an edge.

Required Methods§

source

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

Returns an iterator over the neighbors of a given node.

source

fn edge_neighbor_iterator( graph: &'a Graph, edge: Graph::EdgeIndex ) -> Self::EdgeNeighborIterator

Returns an iterator over the neighbors of an edge.

Implementors§