Expand description
indices_union_find provides data structures for managing unions of possibly overlapping index sets.
An efficient and minimal union-find (disjoint-set) implementation over generic unsigned index types.
Structs§
- Partition
- Represents a partition of the integer line into alternating filled and empty intervals.
- Union
Find - A disjoint-set (union-find) data structure for elements indexed by type
U.
Traits§
- Unsigned
Index - Marker trait for unsigned integer types supported by
UnionFind.
Functions§
- merge_
intervals - Merges a sorted list of possibly overlapping or adjacent intervals into a list of disjoint intervals by coalescing overlaps and adjacencies.