graphinius
graphinius copied to clipboard
Define and implement community detection algorithms
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
- [ ] measure graph modularity based on different algorithms against networkx/neo4j