ReversedGraph in rustc_data_structures::graph::reversed - Rust (original) (raw)

Struct ReversedGraph

Source

pub struct ReversedGraph<G> {
    pub inner: G,
}

Expand description

View that reverses the direction of edges in its underlying graph, so that successors become predecessors and vice-versa.

Because of impl<G: Graph> Graph for &G, the underlying graph can be wrapped by-reference instead of by-value if desired.

Fields§

§inner: G

Implementations§

Trait Implementations§

Auto Trait Implementations§

Blanket Implementations§

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.