Struct petgraph::graph::WalkEdges
[−]
[src]
pub struct WalkEdges<Ix: IndexType = DefIndex> {
// some fields omitted
}Deprecated.
A “walker” object that can be used to step through the edge list of a node.
See .walk_edges_directed() for more information.
Methods
impl<Ix: IndexType> WalkEdges<Ix>
fn next<N, E, Ty: EdgeType>(&mut self, g: &Graph<N, E, Ty, Ix>) -> Option<EdgeIndex<Ix>>
Fetch the next edge index in the walk for graph g.
fn next_neighbor<N, E, Ty: EdgeType>(&mut self, g: &Graph<N, E, Ty, Ix>) -> Option<(EdgeIndex<Ix>, NodeIndex<Ix>)>
Fetch the next edge index and the next node index in the walk for graph g.
The next node indices are always the others than the starting point
where the WalkEdges value was created.
For an Outgoing walk, the target nodes,
for an Incoming walk, the source nodes of the edge.