This section describes the variations of the Connected Components algorithm in the Neo4j Labs Graph Algorithms library.
For general information about the union find algorithm see Weakly Connected Components (
The variants of the UnionFind algorithm was developed by the Neo4j Labs team and is not officially supported.
The 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