Adding/Removing an edge and re-run Leiden about leidenalg

[vtraag]

Sorry about the very long delay. The easiest might be to simply supply the initial_membership argument in find_partition. More generally, you can always first create a new partition and then improve it further, see the docs for more details on that.

The alternative that you suggested is also a good one to see how stable the communities are with respect to the additional / removed edge. However, note that you will not necessarily keep the membership of the original graph fixed.

one major problem is the different partitions I get every time I run the algorithm even when I give the same seed.

This should not happen. If you use the same random seed, it should always return the same result. Could you provide a small reproducible example that shows that you get different results, even when using the same seed?

[vtraag]

I'm closing this for now. If you do still have an issue @gebaltso, feel free to re-open this issue (or open a new issue if it is a new problem of course).