View source: R/core identification.R
largest.component | R Documentation |
Finds the largest component in a network.
largest.component(graph, cut.off = 1, result = c("graph", "vector"))
graph |
a igraph network object |
cut.off |
is the minimum number of weighted affiliation memberships a component member has to have. |
result |
either a graph with the largest component or a logical vector. |
a graph object
data(den)
den.health <- has.tags(den, "Health", res = "relations")
graph.health <- elite.network(den.health)
largest.component(graph.health)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.