Struct graphalgos::util::DisjointSet

pub struct DisjointSet<T>where
    T: Clone + Eq + Hash,{ /* private fields */ }

Disjoint Set Definition

Implementations

impl<T> DisjointSet<T>where T: Clone + Eq + Hash,

pub fn new() -> Self

Associate Function Creates a new Disjoint Set

Example

let mut set = DisjointSet::new(); // creates a new Disjoint set

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());
}

pub fn find(&self, val: &T) -> T

Find parent of the value

Example

set.find(&vertex)

pub fn union(&mut self, a: &T, b: &T)

Union function for two nodes (vertices)

Example

set.union(&vertex1, &vertex2)