Struct petgraph::visit::Reversed
[−]
[src]
pub struct Reversed<G>(pub G);
Wrapper type for walking the graph as if all edges are reversed.
pub struct Reversed<G>(pub G);
Wrapper type for walking the graph as if all edges are reversed.
impl<'a, 'b, N, E: 'a, Ty, Ix> NeighborIter<'a> for Reversed<&'b Graph<N, E, Ty, Ix>> where Ty: EdgeType, Ix: IndexType
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
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
impl<'a, G> Revisitable for Reversed<&'a G> where G: Revisitable
impl<'a, G: Graphlike> Graphlike for Reversed<&'a G>
type NodeId = G::NodeId
impl<'a, G: Visitable> Visitable for Reversed<&'a G>