Trait petgraph::visit::IntoNeighbors

pub trait IntoNeighbors: GraphRef {
    type Neighbors: Iterator<Item=Self::NodeId>;
    fn neighbors(self, n: Self::NodeId) -> Self::Neighbors;
}

Associated Types

type Neighbors: Iterator<Item=Self::NodeId>

Required Methods

fn neighbors(self, n: Self::NodeId) -> Self::Neighbors

Implementors

• impl<'a, N, E: 'a, Ty, Ix> IntoNeighbors for &'a StableGraph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<'a, N: 'a, E> IntoNeighbors for &'a GraphMap<N, E> where N: Copy + Ord + Hash
• impl<'a, 'b, G> IntoNeighbors for &'b Frozen<'a, G> where &'b G: IntoNeighbors, G: GraphBase<NodeId=&'b G::NodeId>
• impl<'b, N, E, Ty, Ix> IntoNeighbors for AsUndirected<&'b Graph<N, E, Ty, Ix>> where Ty: EdgeType, Ix: IndexType
• impl<'a, N, E: 'a, Ty, Ix> IntoNeighbors for &'a Graph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<'a, G> IntoNeighbors for &'a G where G: Copy + IntoNeighbors
• impl<G> IntoNeighbors for Reversed<G> where G: IntoNeighborsDirected