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§
Source§impl<G> ReversedGraph<G>
impl<G> ReversedGraph<G>
Trait Implementations§
Source§impl<G: Clone> Clone for ReversedGraph<G>
impl<G: Clone> Clone for ReversedGraph<G>
Source§fn clone(&self) -> ReversedGraph<G>
fn clone(&self) -> ReversedGraph<G>
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl<G: Debug> Debug for ReversedGraph<G>
impl<G: Debug> Debug for ReversedGraph<G>
Source§impl<G: DirectedGraph> DirectedGraph for ReversedGraph<G>
impl<G: DirectedGraph> DirectedGraph for ReversedGraph<G>
type Node = <G as DirectedGraph>::Node
Source§fn iter_nodes(
&self,
) -> impl Iterator<Item = Self::Node> + DoubleEndedIterator + ExactSizeIterator
fn iter_nodes( &self, ) -> impl Iterator<Item = Self::Node> + DoubleEndedIterator + ExactSizeIterator
Iterates over all nodes of a graph in ascending numeric order. Read more
Source§impl<G: Successors> Predecessors for ReversedGraph<G>
impl<G: Successors> Predecessors for ReversedGraph<G>
Source§impl<G: Predecessors> Successors for ReversedGraph<G>
impl<G: Predecessors> Successors for ReversedGraph<G>
impl<G: Copy> Copy for ReversedGraph<G>
Auto Trait Implementations§
impl<G> DynSend for ReversedGraph<G>where
G: DynSend,
impl<G> DynSync for ReversedGraph<G>where
G: DynSync,
impl<G> Freeze for ReversedGraph<G>where
G: Freeze,
impl<G> RefUnwindSafe for ReversedGraph<G>where
G: RefUnwindSafe,
impl<G> Send for ReversedGraph<G>where
G: Send,
impl<G> Sync for ReversedGraph<G>where
G: Sync,
impl<G> Unpin for ReversedGraph<G>where
G: Unpin,
impl<G> UnwindSafe for ReversedGraph<G>where
G: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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.