Description Usage Arguments Details Value
View source: R/graphs_algorithms.R
rewiring a link to some node with more links. (richer get richer)
1 | bigraphs_rewiring_onestep(B, connected = TRUE, ntry = 100)
|
B |
incidence matrix of bipartite network, rows and cols represent two groups of nodes/species |
connected, |
if the new graph should be connected? |
ntry, |
how many to try? |
.
the incidence matrix whose nestedness has been optimized by rewiring a link.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.