Struct petgraph::visit::Reversed
[−]
[src]
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,
[src]
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>,
[src]
G: NeighborsDirected<'a>,
type NeighborsDirected = <G as NeighborsDirected<'a>>::NeighborsDirected
fn neighbors_directed(
&'a self,
n: G::NodeId,
d: EdgeDirection
) -> Self::NeighborsDirected
&'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>,
[src]
G: Externals<'a>,
type Externals = <G as Externals<'a>>::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,
[src]
G: Revisitable,