Package org.openrs2.util.collect


Link copied to clipboard
interface DisjointSet<T> : Iterable<DisjointSet.Partition<T>>

A data structure containing a set of elements partitioned into a number of non-overlapping subsets. New elements belong to singleton subsets. The union function combines two subsets together into a single larger subset.

Link copied to clipboard
class ForestDisjointSet<T> : DisjointSet<T>

A DisjointSet implementation backed by a disjoint-set forest, as described in chapter 21.3 of the third edition of CLRS. It uses path compression and union by rank.

Link copied to clipboard
class UniqueQueue<T>