Struct petgraph::visit::Reversed

pub struct Reversed<G>(pub G);

Wrapper type for walking the graph as if all edges are reversed.

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, 'b, G> NeighborsDirected<'a> for Reversed<&'b G> where G: NeighborsDirected<'a>

type NeighborsDirected = G::NeighborsDirected

fn neighbors_directed(&'a self, n: G::NodeId, d: EdgeDirection) -> Self::NeighborsDirected

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

impl<'a, 'b, G> Externals<'a> for Reversed<&'b G> where G: Externals<'a>

type Externals = G::Externals

fn externals(&'a self, d: EdgeDirection) -> Self::Externals

Return an iterator of all nodes with no edges in the given direction

impl<'a, G> Revisitable for Reversed<&'a G> where G: Revisitable

fn reset_map(&self, map: &mut Self::Map)

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

type NodeId = G::NodeId

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

type Map = G::Map

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