Trait petgraph::visit::IntoNeighbors [−][src]
pub trait IntoNeighbors: GraphRef { type Neighbors: Iterator<Item = Self::NodeId>; fn neighbors(self, a: Self::NodeId) -> Self::Neighbors; }
Expand description
Access to the neighbors of each node
The neighbors are, depending on the graph’s edge type:
Directed
: All targets of edges froma
.Undirected
: All other endpoints of edges connected toa
.
Associated Types
Required methods
Implementations on Foreign Types
Implementors
impl<'a, G, F> IntoNeighbors for &'a EdgeFiltered<G, F> where
G: IntoEdges,
F: FilterEdge<G::EdgeRef>,
impl<'a, G, F> IntoNeighbors for &'a NodeFiltered<G, F> where
G: IntoNeighbors,
F: FilterNode<G::NodeId>,
impl<'a, N, E, Ty, Ix> IntoNeighbors for &'a Csr<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, N, E: 'a, Ty, Ix> IntoNeighbors for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<'a, N, E: 'a, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IntoNeighbors for &'a MatrixGraph<N, E, Ty, Null, Ix>