Class QuickFindUF

src/common/uf.rs:41–44

The QuickUnionUF represents a union–find data type (also known as the disjoint-sets data type). It supports the classic union and find operations, along with a count operation that returns the total number of sets. The union–find data type models a collection of sets containing n elements, with each element in exactly one set. The elements are named 0 through n–1. Initially, there are n sets, wit

/// For alternative implementations of the same API, see
/// UF, QuickFindUF, and WeightedQuickUnionUF.
pub struct QuickFindUF {
    id: Vec<usize>, // id[i] = component identifier of i
    count: usize,   // number of components
}

/// In particular, suppose that we use quick-find for the dynamic connectivity
/// problem and wind up with a single component. This requires at least N - 1