Description Usage Arguments Value
Finds the largest component in a network
1 | largest.component(graph, cut.off = 1)
|
graph |
a igraph network object |
cut.off |
is the minimum number of weighted affiliation memberships a component member has to have. |
a graph object
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.