Trait daggy::petgraph::visit::NeighborsDirected
[−]
pub trait NeighborsDirected<'a>: Graphlike where Self::NeighborsDirected::Item == Self::NodeId { type NeighborsDirected: Iterator; fn neighbors_directed(&'a self, n: Self::NodeId, d: EdgeDirection) -> Self::NeighborsDirected; }
NeighborsDirected gives access to neighbors of both Incoming
and Outgoing
edges of a node.
Associated Types
type NeighborsDirected: Iterator
Required Methods
fn neighbors_directed(&'a self, n: Self::NodeId, d: EdgeDirection) -> Self::NeighborsDirected
Return an iterator that visits all neighbors of the node n.
Implementors
impl<'a, N, E, Ty, Ix> NeighborsDirected<'a> for Graph<N, E, Ty, Ix> where E: 'a, Ix: IndexType, Ty: EdgeType
impl<'a, 'b, G> NeighborsDirected<'a> for Reversed<&'b G> where G: NeighborsDirected<'a>