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 (`algo.unionFind`

).

The variants of the UnionFind algorithm is experimental and not officially supported. |

The experimental implementations vary from the default in the following ways:

`algo.unionFind.forkJoinMerge`

- The resulting
`DisjointSetStruct`

of each node-partition is merged by the`ForkJoin`

pool, while the calculation of the`DisjointSetStruct`

is done by the`ExecutorService`

.

`algo.unionFind.forkJoin`

- Calculation and merge using
`forkJoinPool`