Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Define and implement community detection algorithms #74

Open
9 tasks
cassinius opened this issue Jun 19, 2019 · 1 comment
Open
9 tasks

Define and implement community detection algorithms #74

cassinius opened this issue Jun 19, 2019 · 1 comment

Comments

@cassinius
Copy link
Collaborator

cassinius commented Jun 19, 2019 •
edited
Loading

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
Copy link
Collaborator Author

  • measure graph modularity based on different algorithms against networkx/neo4j

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@cassinius