Compute modularity and number communities

LCC_subgraph(g)

Arguments

g

a graph.

Value

list(LCC, leftovers) where:

* LCC is the largest connected components * leftovers the nodes (labels or indeces depending on the network) that do not belong to the LCC.