Missing features

[DavidSvejda2507]

HI,

It seems like this implementation of the Leiden algorithm doesn't implement all of the features described in the paper "From Louvain to Leiden: guaranteeing well-connected communities". Specifically:

In the refinement phase, nodes are not necessarily greedily merged with the community that yields the largest increase in the quality function. Instead, a node may be merged with any community for which the quality function increases. The community with which a node is merged is selected randomly18. The larger the increase in the quality function, the more likely a community is to be selected. The degree of randomness in the selection of a community is determined by a parameter θ > 0.

and

Importantly, mergers are performed only within each community of the partition P. In addition, a node is merged with a community in P_refined only if both are sufficiently well connected to their community in P

This mismatch between the description of the algorithm and the code in this repo is not represented in the readme as far as I can tell. Are these features coming at some point in the future?

Kind regards, David