unionfind

package

v1.3.60 Latest Latest Go to latest Published: Dec 3, 2025 License: MIT Imports: 2 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type UnionFind[T comparable] struct {
	// contains filtered or unexported fields
}

UnionFind is a data structure that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets.

func New[T comparable]() *UnionFind[T]

NewUnionFind creates and returns a new UnionFind instance.

func (uf *UnionFind[T]) Find(x T) T

Find returns the representative (root) of the set that x belongs to.

func (uf *UnionFind[T]) Groups() [][]T

func (uf *UnionFind[T]) Groups2() iter.Seq2[int, []T]

func (uf *UnionFind[T]) Union(x, y T) bool

Union merges the sets containing x and y.