-
Hi,
This is a feature request. I have found an old version of distributed Louvain algorithm implemented by using GraphX, and I was wondering if it is possible to have this algorithm next to LPA as …
-
The [Louvain algorithm](https://en.wikipedia.org/wiki/Louvain_method) is commonly used to identify communities in graphs, and is present in other libraries/tools such as [NetworkX](https://networkx.or…
-
Hello, thanks for the algorithm! I have a question: I have some graphs saved as .gt format now (very large, about 100+ G per file), how can I use them to run the louvain-communities-openmp-dynamic cod…
-
It should be nice to have more community detection algorithm for petgraph.
Louvain algorithm is based on modularity optimisation (see https://arxiv.org/abs/0803.0476) and scale linear to the size of …
-
## **Related Problem & Feature Request**
### **Related Problem**
In the official [**Grid2Op repo**](https://github.com/rte-france/Grid2Op); a Multi-Agent Reinforcement Learning(MARL) example is …
-
Hi,
I couldn't find a Pregel implementation of the Louvain algorithm for community detection in ArangoDB. Are there any plans to implement it?
-
_Louvain_ is an algorithm for detecting communities in networks that relies upon a heuristic for maximizing the modularity.
- [x] single threaded implementation Louvain Phase 1 (modularity based c…
-
Depends on #17.
- [ ] QLouvain (Search + MaxFind, just Search)
- [ ] Repeat Version of QLouvain (Search + MaxFind, just Search)
- [ ] QEdgeLouvain: grover/max on edges (also implement a classical…
-
Just a question to ask how to use the parameter that it is mentioned also in the original GDS page in the algorithm presentation. Apparently there is some one to one correspondence with some parameter…
-
### What is your question?
Hi,
I use the Leiden clustering a lot. Louvain as well, sometimes. I am experiencing big differences in the results when I use 23.02 and newer versions. My dataset has 80…