Struct daggy::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, Ty, Ix> NeighborIter<'a> for Reversed<&'b Graph<N, E, Ty, Ix>> where E: 'a, Ix: IndexType, Ty: EdgeType
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) -> Reversed<&'b G>::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) -> Reversed<&'b G>::Externals
Return an iterator of all nodes with no edges in the given direction