pub struct LargeGraphIterator<N: Node, E: EdgeWeight> { /* private fields */ }
Expand description
Memory-efficient iterator for large graph traversals
Implementations§
Source§impl<N: Node, E: EdgeWeight> LargeGraphIterator<N, E>
impl<N: Node, E: EdgeWeight> LargeGraphIterator<N, E>
Auto Trait Implementations§
impl<N, E> Freeze for LargeGraphIterator<N, E>
impl<N, E> RefUnwindSafe for LargeGraphIterator<N, E>where
N: RefUnwindSafe,
E: RefUnwindSafe,
impl<N, E> Send for LargeGraphIterator<N, E>
impl<N, E> Sync for LargeGraphIterator<N, E>
impl<N, E> Unpin for LargeGraphIterator<N, E>
impl<N, E> UnwindSafe for LargeGraphIterator<N, E>where
N: UnwindSafe,
E: 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> 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