openrs2/org.openrs2.util.collect/ForestDisjointSet

ForestDisjointSet

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.

Constructors

ForestDisjointSet

constructor()

Properties

elements

open override val elements: Int

partitions

open override var partitions: Int

Functions

add

open override fun add(x: T): DisjointSet.Partition<T>

forEach

open fun forEach(p0: Consumer<in DisjointSet.Partition<T>>)

get

open operator override fun get(x: T): DisjointSet.Partition<T>?

iterator

open operator override fun iterator(): Iterator<DisjointSet.Partition<T>>

spliterator

open fun spliterator(): Spliterator<DisjointSet.Partition<T>>

union

open override fun union(x: DisjointSet.Partition<T>, y: DisjointSet.Partition<T>)