Struct Forests

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

Data structure for building disjoint sets

Implementations

impl<T> Forests<T>

where T: Eq + Hash,

pub fn new() -> Forests<T>

pub fn count_sets(&mut self) -> usize

Counts the number of unique disjoint sets.

pub fn group_items(&mut self, items: &[T]) -> Vec<Vec<usize>>

Groups items by their containing sets. The result is the indices of items in the provided items that belongs to different disjoint sets. The order of groups is arbitrary. Items that do not exist in the forest belongs to the same group that does not consist of other contained items.

pub fn make_set(&mut self, item: T)

Makes a new singleton set with exactly one element item.

pub fn find_set(&mut self, item: &T) -> Option<Label>

Find the label of the set item belongs to.

pub fn union(&mut self, item1: &T, item2: &T)

Unions the two sets containing item1 and item2. No-op if either item1 or item2 is not present (i.e. no make_set has been made).

Trait Implementations

impl<T> Default for Forests<T>

where T: Eq + Hash,

fn default() -> Forests<T>

Returns the “default value” for a type.