Struct petgraph::visit::Reversed

pub struct Reversed<G>(pub G);

Wrapper type for walking edges the other way

Trait Implementations

impl<'a, 'b, N, E: 'a, Ty, Ix> NeighborIter<'a> for Reversed<&'b Graph<N, E, Ty, Ix>> where Ty: EdgeType, Ix: IndexType

type Iter = Neighbors<'a, E, Ix>

fn neighbors(&'a self, n: NodeIndex<Ix>) -> Neighbors<'a, E, Ix>

Return an iterator that visits all neighbors of the node n.

impl<'a, V: Graphlike> Graphlike for Reversed<&'a V>

type NodeId = V::NodeId

impl<'a, V: Visitable> Visitable for Reversed<&'a V>

type Map = V::Map

fn visit_map(&self) -> V::Map