I was wondering if anyone was aware of an implementation of the Leiden algorithm for Julia? It is a community detection algorithm which avoids the disconnected /poorly connected community problem associated with the louvain algorithm. I found this implementation here:
However the documentation is a bit sparse. After playing around with it I have encountered several issues. One is that it will randomly flag my input matrix as not symmetric at certain resolution parameters. I am also having a hard time telling if it is calculating values based off of modularity and how to set the null values.
I can dig through the source code in more detail, however, I am still relatively new at Julia and it seems to be taking advantage of a lot of tricks which I don’t know yet. I would appreciate it if anyone could point me in the direction of some more documentation for this implementation or perhaps a different implementation altogether!