Struct petgraph::visit::Reversed [] [src]

pub struct Reversed<G>(pub G);

An edge-reversing graph adaptor.

All edges have the opposite direction with Reversed.

Trait Implementations

impl<G: Copy> Copy for Reversed<G>
[src]

impl<G: Clone> Clone for Reversed<G>
[src]

[src]

Returns a copy of the value. Read more

1.0.0
[src]

Performs copy-assignment from source. Read more

impl<G: Debug> Debug for Reversed<G>
[src]

[src]

Formats the value using the given formatter. Read more

impl<G: GraphBase> GraphBase for Reversed<G>
[src]

node identifier

edge identifier

impl<G: GraphRef> GraphRef for Reversed<G>
[src]

impl<G> Data for Reversed<G> where
    G: Data
[src]

impl<G> IntoNeighbors for Reversed<G> where
    G: IntoNeighborsDirected
[src]

[src]

Return an iterator of the neighbors of node a.

impl<G> IntoNeighborsDirected for Reversed<G> where
    G: IntoNeighborsDirected
[src]

[src]

impl<G: Visitable> Visitable for Reversed<G>
[src]

The associated map type

[src]

Create a new visitor map

[src]

Reset the visitor map (and resize to new size of graph if needed)

impl<G> IntoEdgeReferences for Reversed<G> where
    G: IntoEdgeReferences
[src]

[src]

impl<G> NodeIndexable for Reversed<G> where
    G: NodeIndexable
[src]

[src]

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap). Read more

[src]

Convert a to an integer index.

[src]

Convert i to a node index

impl<G> NodeCompactIndexable for Reversed<G> where
    G: NodeCompactIndexable
[src]

impl<G> IntoNodeIdentifiers for Reversed<G> where
    G: IntoNodeIdentifiers
[src]

[src]

impl<G> IntoNodeReferences for Reversed<G> where
    G: IntoNodeReferences
[src]

[src]

impl<G> GraphProp for Reversed<G> where
    G: GraphProp
[src]

The kind edges in the graph.

[src]

impl<G> NodeCount for Reversed<G> where
    G: NodeCount
[src]

[src]

impl<G> DataMap for Reversed<G> where
    G: DataMap
[src]

[src]

[src]

impl<G> DataMapMut for Reversed<G> where
    G: DataMapMut
[src]

[src]

[src]