This section describes the experimental variations of the Connected Components algorithm in the Neo4j Graph Algorithms library.
For general information about the union find algorithm see Connected Components (
The variants of the UnionFind algorithm is experimental and not officially supported.
The experimental implementations vary from the default in the following ways:
DisjointSetStructof each node-partition is merged by the
ForkJoinpool, while the calculation of the
DisjointSetStructis done by the