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<G: GraphBase> GraphBase for Reversed<G>
[src]
impl<G: GraphRef> GraphRef for Reversed<G>
[src]
impl<G: Copy> Copy for Reversed<G>
[src]
impl<G: Clone> Clone for Reversed<G>
[src]
fn clone(&self) -> Reversed<G>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more
impl<G> IntoNeighbors for Reversed<G> where G: IntoNeighborsDirected
[src]
impl<G> IntoNeighborsDirected for Reversed<G> where G: IntoNeighborsDirected
[src]
type NeighborsDirected = G::NeighborsDirected
fn neighbors_directed(self, n: G::NodeId, d: EdgeDirection) -> G::NeighborsDirected
impl<G> IntoExternals for Reversed<G> where G: IntoExternals
[src]
type Externals = G::Externals
fn externals(self, d: EdgeDirection) -> G::Externals
Return an iterator of all nodes with no edges in the given direction