Struct petgraph::visit::Reversed [−] [src]

pub struct Reversed<G>(pub G);

Wrapper type for walking edges the other way

Trait Implementations

`impl<'a, 'b, N, E, 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>`

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

`type NodeId = V`

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

`type Map = V`

`fn visit_map(&self) -> V`