View source: R/FindModules.leading_eigen.once.R
findModules.leading_eigen.once | R Documentation |
This function tries to find densely connected subgraphs in a graph by calculating the leading non-negative eigenvector of the modularity matrix of the graph.
findModules.leading_eigen.once(adj, min.module.size)
adj |
A n x n upper triangular adjacency in the matrix class format. |
min.module.size |
Optional. Integer between 1 and n genes. (Default = 30) |
GeneModules = n x 3 dimensional data frame with column names as Gene.ID, moduleNumber, and moduleLabel.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.