View source: R/graphs_algorithms.R
1) start from a regular bipartite graph. 2) repeat rewiring a link to a new species who has more neighbors than the old species until failed for enough times. 3) return to step 2)
| 1 | bigraphs_rewiring(graph)
 | 
| 1 2 | 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.