is_cover

is_cover(G, communities)

Returns True if communities is a cover of the nodes of G.

A cover of a graph is a collection of sets of nodes such that every node in the graph belongs to at least one set. Unlike a partition, sets in a cover may overlap.

Parameters:

GNetworkX graph.

communitieslist or iterable of sets of nodes

If not a list, the iterable is converted internally to a list. If it is an iterator it is exhausted. Nodes appearing in communities but not in G are ignored, mirroring the behavior of is_partition().

See also

is_partition

References

[1]

Lancichinetti, A., Fortunato, S., & Kertesz, J. (2009). “Detecting the overlapping and hierarchical community structure in complex networks.” New J. Phys. 11, 033015.