issues
search
Graphinius
/
graphinius
Generic graph (analysis) library in Typescript
MIT License
33
stars
6
forks
source link
Define and implement community detection algorithms
#74
Open
cassinius
opened
5 years ago
cassinius
commented
5 years ago
Preliminary:
[ ] Define algorithms to implement
[ ] Write interfaces / classes
[ ] Write standard test cases
Implement:
[ ] Disjoint Set (Or Union-Find)
[ ] Louvain
[ ] Label propagation
[ ] Girvan–Newman
[ ] SCC / Tarjan
[ ] Triangle count / clustering coefficient
cassinius
commented
4 years ago
[ ] measure graph modularity based on different algorithms against networkx/neo4j
Preliminary:
Implement: