Struct libbgs::markoff::Disjoint

pub struct Disjoint<K> { /* private fields */ }

A set of disjoint sets of instances of K.

Implementations

impl<K: Eq + Clone + Hash> Disjoint<K>

pub fn new() -> Disjoint<K>

Creates a new, empty set of disjoint sets.

pub fn get_sets(&self) -> impl Iterator<Item = (&K, u128)>

Returns an Iterator yielding, for each disjoint set, a representative and the size of the disjoint set, respectively. There are no guarantees about which element will be the chosen representative.

pub fn associate(&mut self, one: K, two: K)

Merge two disjoint sets; specifically, if one is in $S$ and two is in $T$, then $S$ and $T$ are replaced by $S \cup T$. If either one or two were not previously in this set of disjoint sets, then they are considered to be singletons, and then merged.