This function takes a matrix, and performs a search for the best
partition in modules.
findModules(M, iter = 50, sparse = TRUE, ...)
An adjacency matrix
Number of optimization runs to do
Whether the matrix should be made sparse
M <- matrix(rbinom(100, 1, 0.3), ncol=10)
M <- M[rowSums(M)>0, colSums(M)>0]
mod <- findModules(M, iter=2, sparse=FALSE)
Questions? Problems? Suggestions? Tweet to @rdrrHQian@mutexlabs.com.
Please suggest features or report bugs with the GitHub issue tracker.
All documentation is copyright its authors; we didn't write any of that.