Community detection algorithms are sometimes part of a library (such as JUNG for java) or a tool (see Gephi). When authors publish a new method, they do sometimes make their code available. For example, the Louvain and Infomap methods.
You can try the SNAP library (Stanford Network Analysis Platform, http://snap.stanford.edu/), which includes Modularity, Girvan-Newman and Clauset-Newman-Moore algorithms. It's written in C++, and is under the BSD licence. As a number of papers have used it (see, http://snap.stanford.edu/papers.html), it should be good.
We have recently implemented our algorithm, which is based on Constant Potts Model, fast Louvain optimization, and reliable map equation of InfoMap for weighted and signed networks. Here is the open source java project + an executable jar.
发布评论
评论（4）
社区检测算法有时是库的一部分（例如 Java 的 JUNG）或工具（请参阅 Gephi）。当作者发布新方法时，他们有时会公开他们的代码。例如，Louvain 和 Infomap 方法。
旁注：Girvan-Newman 算法有时仍在使用，但它大多已被更快、更准确的方法所取代。为了更好地概述该主题，我建议社区检测算法：比较分析或更长的图表中的社区检测（103页）。
Community detection algorithms are sometimes part of a library (such as JUNG for java) or a tool (see Gephi). When authors publish a new method, they do sometimes make their code available. For example, the Louvain and Infomap methods.
Side note: Girvan-Newman algorithm is sometimes still used, but it has mostly been replaced by faster and more accurate methods. For a good overview of the topic, I recommend Community detection algorithms: a comparative analysis or the longer Community detection in graphs (103 pages).
您应该查看 igraph 库：
在我看来，这是最完整的社区检测工具。
有关更多详细信息，另请检查：什么igraph中的社区检测算法有什么区别？
You should have a look at the igraph library:
To my opinion, the most complete tool for community detection.
For more details, also check: What are the differences between community detection algorithms in igraph?
您可以尝试 SNAP 库（斯坦福网络分析平台，http://snap.stanford.edu/），其中包括模块化、Girvan-Newman 和 Clauset-Newman-Moore 算法。它是用 C++ 编写的，并遵循 BSD 许可证。由于许多论文都使用了它（请参阅http://snap.stanford.edu/papers.html< /a>），应该不错。
You can try the SNAP library (Stanford Network Analysis Platform, http://snap.stanford.edu/), which includes Modularity, Girvan-Newman and Clauset-Newman-Moore algorithms. It's written in C++, and is under the BSD licence. As a number of papers have used it (see, http://snap.stanford.edu/papers.html), it should be good.
我们最近实现了我们的算法，该算法基于 Constant Potts 模型、快速 Louvain 优化和加权和符号网络的 InfoMap 的可靠映射方程。 这里是开源java项目+可执行jar。
We have recently implemented our algorithm, which is based on Constant Potts Model, fast Louvain optimization, and reliable map equation of InfoMap for weighted and signed networks. Here is the open source java project + an executable jar.