Description Usage Arguments Value Author(s)
A naive implementation of community detection in a fully-connected weighted graph based on Newman ME, Girvan M. Finding and evaluating community structure in networks. Physical review E. 2004 Feb 26;69(2):026113.
1 2 | inferCommunitiesGreedily(similarities, save.file = NULL,
full_trajectory = F, simplify = T, loop_limit = Inf)
|
similarities |
a data frame with columns a, b, similarity representing the similarities between nodes. We assume undirected graph and b < a. |
a data frame with two columns, n - node id (taken from a, b of input) and cluster - unique cluster ID.
Yuriy Sverchkov
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.