h:SrSSKrS/r\RS5rg)z2Helper functions for community-finding algorithms.N is_partitionc[U[5(d [U5nUVVs1sHo"H o3U;dM UiM M nnn[U5[U5s=:H=(a [SU55:H$s $s snnf)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# UHn[U5v M g7f)N)len).0cs _/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/community/community_utils.py is_partition..s&C{!s1vv{s) isinstancelistrsum)G communitiesrnnodess r rrsl$ k4 ( (;' # 9 1Qq&QQQ E 9 q6SZ C C3&C{&C#C CC CC :s A< A<)__doc__networkxnx__all__ _dispatchablerr rs/8  DDr