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
impl<'a, NodeData, EdgeData: 'a> NavigableGraph<'a> for DiGraph<NodeData, EdgeData, usize>
[src]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
[src]fn in_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::InNeighbors
[src]