pub struct Afforest<NI: Idx>(/* private fields */);
Expand description
A union find data structure based on [1].
Note, that this data structure requires calling compress
before calling find
in order to return the correct set id.
[1] Michael Sutton, Tal Ben-Nun, Amnon Barak: “Optimizing Parallel Graph Connectivity Computation via Subgraph Sampling”, Symposium on Parallel and Distributed Processing, IPDPS 2018
Implementations§
Trait Implementations§
source§impl<NI: Idx> Components<NI> for Afforest<NI>
impl<NI: Idx> Components<NI> for Afforest<NI>
source§impl<NI: Idx> UnionFind<NI> for Afforest<NI>
impl<NI: Idx> UnionFind<NI> for Afforest<NI>
impl<NI: Idx> Send for Afforest<NI>
impl<NI: Idx> Sync for Afforest<NI>
Auto Trait Implementations§
impl<NI> !RefUnwindSafe for Afforest<NI>
impl<NI> Unpin for Afforest<NI>
impl<NI> UnwindSafe for Afforest<NI>where NI: 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