Struct Reversed 

pub struct Reversed<'graph, G> { /* private fields */ }

Implementations

impl<'graph, G> Reversed<'graph, G>

pub const fn new(graph: &'graph G) -> Self

pub const fn inner(&self) -> &'graph G

Trait Implementations

impl<'graph, G: Clone> Clone for Reversed<'graph, G>

fn clone(&self) -> Reversed<'graph, G>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'graph, G: Copy> Copy for Reversed<'graph, G>

impl<'graph, G: Debug> Debug for Reversed<'graph, G>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<G: GraphView> GraphView for Reversed<'_, G>

type Node = <G as GraphView>::Node

type Edge = <G as GraphView>::Edge

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn contains_node(&self, node: Self::Node) -> bool

fn contains_edge(&self, edge: Self::Edge) -> bool

fn node_indices(&self) -> impl Iterator<Item = Self::Node> + '_

fn edge_indices(&self) -> impl Iterator<Item = Self::Edge> + '_

fn edge_endpoints(&self, edge: Self::Edge) -> Option<EdgeEndpoints<Self::Node>>

fn outgoing_edges( &self, node: Self::Node, ) -> impl Iterator<Item = Self::Edge> + '_

fn incoming_edges( &self, node: Self::Node, ) -> impl Iterator<Item = Self::Edge> + '_

fn edge_references( &self, ) -> impl Iterator<Item = (Self::Edge, EdgeEndpoints<Self::Node>)> + '_

impl<G: IndexGraphView> IndexGraphView for Reversed<'_, G>

fn node_bound(&self) -> usize

fn edge_bound(&self) -> usize

fn node_slot(node: Self::Node) -> usize

fn edge_slot(edge: Self::Edge) -> usize