pub struct Cycle<N> {
pub nodes: Vec<N>,
}Expand description
A cycle reported by Graph::topological_sort / Graph::reverse_topological_sort.
Fields§
§nodes: Vec<N>Nodes that participate in at least one cycle, in deterministic order.
Trait Implementations§
impl<N: Eq> Eq for Cycle<N>
impl<N> StructuralPartialEq for Cycle<N>
Auto Trait Implementations§
impl<N> Freeze for Cycle<N>
impl<N> RefUnwindSafe for Cycle<N>where
N: RefUnwindSafe,
impl<N> Send for Cycle<N>where
N: Send,
impl<N> Sync for Cycle<N>where
N: Sync,
impl<N> Unpin for Cycle<N>where
N: Unpin,
impl<N> UnsafeUnpin for Cycle<N>
impl<N> UnwindSafe for Cycle<N>where
N: 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> 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 more