recursiveigraph {MODA} | R Documentation |
Modules detection using igraph's community detection algorithms, when the resulted module is larger than expected, it is further devided by the same program
recursiveigraph(g, savefile, method = c("fastgreedy", "louvain"), maxsize = 200, minsize = 30)
g |
igraph object, the network to be partitioned |
savefile |
plain text, used to store module, each line as a module |
method |
specify the community detection algorithm |
maxsize |
maximal module size |
minsize |
minimal module size |
None
Dong Li, dxl466@cs.bham.ac.uk
Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of statistical mechanics: theory and experiment 2008.10 (2008): P10008.