libmaths
communities
| libmaths | communities | |
|---|---|---|
| 3 | 12 | |
| 75 | 698 | |
| - | - | |
| 0.0 | 4.0 | |
| over 2 years ago | 6 months ago | |
| Python | Python | |
| MIT License | 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.
libmaths
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?
threeXYZgraphing - 3d xyz graphing using threejs
graphtage - A semantic diff utility and library for tree-like files such as JSON, JSON5, XML, HTML, YAML, and CSV.
SymPy - A computer algebra system written in pure Python
pytextrank - Python implementation of TextRank algorithms ("textgraphs") for phrase extraction
algorithms_illuminated - Python implementations and tests for the Algorithms Illuminated book series. Some test cases from the following repository: https://github.com/beaunus/stanford-algs
leidenalg - Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
algorithms-python - Set of solutions of classic algorithmic problems written in Python
NetworkX - Network Analysis in Python
pygraphblas - GraphBLAS for Python
traph - A terminal/cmd graph algorithm visualiser
fxpmath - A python library for fractional fixed-point (base 2) arithmetic and binary manipulation with Numpy compatibility.