Struct graphalgos::util::DisjointSet
source · pub struct DisjointSet<T>where
T: Clone + Eq + Hash,{ /* private fields */ }
Expand description
Disjoint Set Definition
Implementations§
source§impl<T> DisjointSet<T>where
T: Clone + Eq + Hash,
impl<T> DisjointSet<T>where T: Clone + Eq + Hash,
sourcepub fn new() -> Self
pub fn new() -> Self
Associate Function Creates a new Disjoint Set
Example
let mut set = DisjointSet::new(); // creates a new Disjoint set
sourcepub fn set_insert(&mut self, val: T)
pub fn set_insert(&mut self, val: T)
Insert a value to the set
Example
// Add all the vertices of graph g to the disjoint set
for (node, _) in &g.vertices {
set.set_insert(node.clone());
}
Auto Trait Implementations§
impl<T> RefUnwindSafe for DisjointSet<T>where T: RefUnwindSafe,
impl<T> Send for DisjointSet<T>where T: Send,
impl<T> Sync for DisjointSet<T>where T: Sync,
impl<T> Unpin for DisjointSet<T>where T: Unpin,
impl<T> UnwindSafe for DisjointSet<T>where T: 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