template<typename IndexType_>
dip::SimpleUnionFind class

A simplified version of dip::UnionFind that doesn’t store any information about the regions, only equivalences.

Base classes

template<typename IndexType_, typename ValueType_, typename UnionFunction_>
class dip::UnionFind
An STL-like data structure for the union-find algorithm.

Constructors, destructors, assignment and conversion operators

SimpleUnionFind()
Default constructor, creates an empty structure
SimpleUnionFind(dip::uint n) explicit
Alternate constructor, creates n trees.