Vincent Traag

There might be some possibilities in this direction. I will try to see what I can do, but it might take some time.

Well, we already do have some solutions in another context. The question is how to best adapt it to the more general framework of this package.

> @vtraag Can you expand on this bit? Is there another algorithm which does have minimum size restrictions? In the Java version of the Leiden algorithm, we are using an...

Indeed, `find_partition` does not support this argument now right away. For more advanced uses, you should construct an `Optimiser` object and call `optimise_partition`, for which you can use the argument...

Sorry for the late response! I would definitely be open to more quality functions being added to the package. I don't have much time to do that myself at the...

In principle, yes, it can be made available, but similar to https://github.com/vtraag/leidenalg/issues/91 I would need to find the time to do so. In principle, contributing a new quality function is...

Sorry for the late reply! Could you perhaps include some code that demonstrates the problem for you? If I run ``` part1 = la.find_partition(G, la.ModularityVertexPartition, seed=0) part2 = la.find_partition(G, la.ModularityVertexPartition,...

When I try to run this on Google Colab, I don't get an error at `leidenalg` installation (although it does install version 0.8.9 instead of 0.8.10, not sure what is...

I'm closing this issue for now. Feel free to re-open if necessary.

The problem seems to be caused by the edges with zero weights. For the time being you can circumvent the problem by simply removing those edges. This can be done...