Description Usage Arguments Value Author(s)
An implementation of community detection by label propagation in an undirected weighted graph based on Raghavan, Albert, Kumara. Phys Rev E 76, 036106 (2007)
1 | inferCommunitiesLP(unique_edges, async_prop = 0.5, check_unique = F)
|
unique_edges |
a data frame with columns a, b, weight representing the connections between nodes. We assume undirected graph, and therefore b < a. |
async_prop |
proportion of nodes to update before synchronous update |
check_unique |
whether to check edges data frame for uniqueness |
a data frame with two columns, node–node id (taken from a, b of input) and label–unique cluster/community ID.
Yuriy Sverchkov
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.