Trait petgraph::visit::IntoNeighborsDirected
source · pub trait IntoNeighborsDirected: IntoNeighbors {
type NeighborsDirected: Iterator<Item = Self::NodeId>;
// Required method
fn neighbors_directed(
self,
n: Self::NodeId,
d: Direction,
) -> Self::NeighborsDirected;
}
Expand description
Access to the neighbors of each node, through incoming or outgoing edges.
Depending on the graph’s edge type, the neighbors of a given directionality are:
Directed
,Outgoing
: All targets of edges froma
.Directed
,Incoming
: All sources of edges toa
.Undirected
: All other endpoints of edges connected toa
.
Required Associated Types§
type NeighborsDirected: Iterator<Item = Self::NodeId>
Required Methods§
fn neighbors_directed( self, n: Self::NodeId, d: Direction, ) -> Self::NeighborsDirected
Object Safety§
This trait is not object safe.