jordanlewis.data.union-find — com.github.pangloss/data.union-find 1.0.66

Persistent disjoint set forests using Tarjan's union-find algorithm.

DisjointSetForest clj protocol

A data structure that maintains information on a number of disjoint sets.

get-canonical clj

(get-canonical this x)

Get the canonical element of an element. Return a vector of two elements: a new disjoint set forest that may have been modified due to the path compression optimization, and the canonical element of the input, or nil if no such element exists in the forest.

union clj

(union this x y)

Union two sets. Return a new disjoint set forest with the sets that x and y belong to unioned.

IMutableUFNode clj protocol

set-immutable! clj

(set-immutable! n)

set-parent! clj

(set-parent! n p)

set-rank! clj

(set-rank! n r)

IUFNode clj protocol

mutable-node? clj

(mutable-node? n)

parent clj

(parent n)

rank clj

(rank n)

value clj

(value n)

TransientDisjointSetForest clj protocol

A data structure that maintains information on a number of disjoint sets.

union! clj

(union! this x y)

Union two sets. Return a mutated disjoint set forest with the sets that x and y belong to unioned.

union-find clj

(union-find & xs)

Returns a new union-find data structure with provided elements as singletons.