Fold whole neighbourhoods into a few groups: communities of densely linked nodes, found
with the Leiden algorithm, at a level from fine (1) to coarse (7). Only offered when
declared. Computed off the page in the compute worker when one can start; meanwhile the
previous grouping stays. A group may mix types.
Fold whole neighbourhoods into a few groups: communities of densely linked nodes, found with the Leiden algorithm, at a level from fine (1) to coarse (7). Only offered when declared. Computed off the page in the compute worker when one can start; meanwhile the previous grouping stays. A group may mix types.