Trait traitgraph::NavigableGraph

pub trait NavigableGraph<'a>: GraphBase {
    type OutNeighbors: IntoIterator<Item = Neighbor<Self::NodeIndex, Self::EdgeIndex>>;
    type InNeighbors: IntoIterator<Item = Neighbor<Self::NodeIndex, Self::EdgeIndex>>;
    fn out_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::OutNeighbors;
    fn in_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::InNeighbors;
}

Associated Types

type OutNeighbors: IntoIterator<Item = Neighbor<Self::NodeIndex, Self::EdgeIndex>>

type InNeighbors: IntoIterator<Item = Neighbor<Self::NodeIndex, Self::EdgeIndex>>

Loading content...

Required methods

fn out_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::OutNeighbors

fn in_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::InNeighbors

Loading content...

Implementations on Foreign Types

impl<'a, NodeData, EdgeData: 'a> NavigableGraph<'a> for DiGraph<NodeData, EdgeData, usize>

type OutNeighbors = Map<Edges<'a, EdgeData, Directed, usize>, fn(_: EdgeReference<'a, EdgeData, usize>) -> Neighbor<Self::NodeIndex, Self::EdgeIndex>>

type InNeighbors = Map<Edges<'a, EdgeData, Directed, usize>, fn(_: EdgeReference<'a, EdgeData, usize>) -> Neighbor<Self::NodeIndex, Self::EdgeIndex>>

fn out_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::OutNeighbors

fn in_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::InNeighbors

Loading content...

Implementors

Loading content...