9.3.1. The Connected Components algorithm

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

The variants of the UnionFind algorithm was developed by the Neo4j Labs team and is not officially supported.

9.3.1.1. Additional implementations

The 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