+ jbRt^RItRR.t]PR4t]PR4tR#)z2Helper functions for community-finding algorithms.Nis_cover is_partitionc\V\4'g \V4pVUUu0uFq"F q3V9gK VkK K ppp\V4\V4u;8H;'d\RV448H#u#uuppi)a{Returns *True* if `communities` is a partition of the nodes of `G`. A partition of a universe set is a family of pairwise disjoint sets whose union is the entire universe set. Parameters ---------- G : NetworkX graph. communities : list 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. c38"TFp\V4xK R#5i)N)len).0cs& n/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/community/community_utils.py is_partition..s&C{!s1vv{s) isinstancelistrsumG communitiesrnnodess&& r rrsn$ k4 ( (;' # 9 1Qq&QQQQ E 9 q6SZ C C3&C{&C#C CC CC :s A= A=c\V\4'g \V4pVUUu0uFq"F q3V9gK VkK K ppp\V4\V48H#uuppi)aReturns *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 ---------- G : NetworkX graph. communities : list 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 :func:`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. )r r rrs&& r rr!sU8 k4 ( (;' # 9 1Qq&QQQQ E 9 u:Q  :s A A)__doc__networkxnx__all__ _dispatchablerrr rsK8 ~ &DD0  r