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: 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: GraphBase> GraphBase for Reversed<G>[src]
impl<G: GraphRef> GraphRef for Reversed<G>[src]
impl<G> IntoNodeIdentifiers for Reversed<G> where G: IntoNodeIdentifiers[src]
type NodeIdentifiers = G::NodeIdentifiers
fn node_identifiers(self) -> Self::NodeIdentifiers
fn node_count(&self) -> usize
impl<G> IntoNeighbors for Reversed<G> where G: IntoNeighborsDirected[src]
type Neighbors = G::NeighborsDirected
fn neighbors(self, n: G::NodeId) -> G::NeighborsDirected
Return an iterator of the neighbors of node a.
impl<G> IntoNeighborsDirected for Reversed<G> where G: IntoNeighborsDirected[src]
type NeighborsDirected = G::NeighborsDirected
fn neighbors_directed(self, n: G::NodeId, d: Direction) -> G::NeighborsDirected
impl<G> IntoExternals for Reversed<G> where G: IntoExternals[src]
type Externals = G::Externals
fn externals(self, d: Direction) -> G::Externals
Return an iterator of all nodes with no edges in the given direction
impl<G: Visitable> Visitable for Reversed<G>[src]
type Map = G::Map
The associated map type
fn visit_map(&self) -> G::Map
Create a new visitor map
fn reset_map(&self, map: &mut Self::Map)
Reset the visitor map (and resize to new size of graph if needed)