Vincent Traag

I rebased the PR against the `master` branch so that there are no merge conflicts and force-pushed to this PR. Apparently the GitHub actions do not run in the case...

@rabisgon, I was thinking: the improvements you make here for running multilayer stuff could actually more easily implemented in the Leiden algorithm in `igraph`, which only implements CPM/modularity anyhow. The...

Thanks for reporting the issue! I will look into it. @eduramiba, feel free to assign me the issue (if that is possible).

This is normal behaviour. For a certain resolution parameter lower than some threshold, you will always find a single cluster. This is probably not the most relevant clustering, so you...

@mathlandry , no this code is not yet merged. This is a Pull Request with new proposed code that should still be integrated in the main codebase. After it will...

In general, this possibility looks quite useful @gvegayon, thanks for contributing! It has taken slightly longer than a week to get back to you on this :wink: I will have...

Just to be clear what the problem is: the number of edges in the bipartite projection is only ~7 times larger, while the necessary memory is ~112 times larger? Just...

I do agree with @iosonofabio that only the highest level of the Louvain algorithm makes sense from the perspective of optimising modularity. The question of a hierarchical structure is separate...

Oh, sorry, I did not read your @antonkratz reply good enough, apparently it is implemented in R. In principle it should be straightforward to reconstruct the actual tree from the...

> just realized I'm the only one who worries about the star import No, I also don't like it, it obscures very much where something is coming from and makes...