leidenalg
communities
| leidenalg | communities | |
|---|---|---|
| 1 | 12 | |
| 540 | 700 | |
| - | - | |
| 8.0 | 4.0 | |
| about 2 months ago | 6 months ago | |
| Python | Python | |
| GNU General Public License v3.0 only | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
leidenalg
-
[OC] An interactive map of reddit built from 330 million user comments. 2023 update
- iGraph with Leidenalg uses C++ and exposes an interface to python
communities
-
I made a graph neural network specifically for graphs with community structure
I made a tool for plotting graphs with community structure. You can check it out here.
-
[OC] Algorithmically organizing a social network into cliques
A few people are asking what this is a visualization of. OP's graphs look very similar to an example of the Louvain Method shown in the library's documentation. The Louvain Method is a community detection algorithm used on network graphs. It works by iteratively optimizing modularity of the graph. Modularity is a measure of the density of the number of edges (lines between nodes) that fall within a given group/cluster compared to what would be expected from a random distribution of edges throughout the graph.
-
Algorithmically organizing a social network into cliques
I made this visualization with: https://github.com/shobrook/communities
- I made Communities: a library of clustering algorithms for network graphs (link in comments)
- [P] I made Communities: a library of clustering algorithms for network graphs (link in comments)
- I made a library for organizing social networks into cliques (link in comments)
- [P] I made communities: a library for detecting and visualizing clusters in network graphs (link in comments)
- I made 'communities' – a library of clustering algorithms for graphs
- I made 'communities' – a library for detecting communities in graphs, built on numpy
- [Project] I made a lightweight Python library for graph clustering
What are some alternatives?
hdbscan - A high performance implementation of HDBSCAN clustering.
graphtage - A semantic diff utility and library for tree-like files such as JSON, JSON5, XML, HTML, YAML, and CSV.
kmodes - Python implementations of the k-modes and k-prototypes clustering algorithms, for clustering categorical data
pytextrank - Python implementation of TextRank algorithms ("textgraphs") for phrase extraction
HybridRenderingEngine - Clustered Forward/Deferred renderer with Physically Based Shading, Image Based Lighting and a whole lot of OpenGL.
libmaths - A Python library created to assist programmers with complex mathematical functions
fuzzy-c-means - A simple python implementation of Fuzzy C-means algorithm.
NetworkX - Network Analysis in Python
Algorithms - Collection of algorithms in multiple programming languages.
traph - A terminal/cmd graph algorithm visualiser