A Flat Union-Find Data Structure

This library that offers a union-find data structure that is stored inside a vector.

Its main module is FlatUnionFind -- click this link for documentation.

Performance

Compared with unionFind, which uses heap-allocated objects and pointers between them, this data structure can (in some usage scenarios) be faster and more compact.

However, because it does not allow the garbage collector to reclaim dead points, it can also be slower and use more space.

Installation and Usage

Type opam install flatunionfind.

In your dune file, add (libraries flatunionfind) to the description of your library or executable.