๓ žราYc@sdZdgZd„ZdS(s2Helper functions for community-finding algorithms.t is_partitioncst‡fd†|DƒƒS(sReturn True if and only 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. `G` is a NetworkX graph. `communities` is an iterable of sets of nodes of `G`. This iterable will be consumed multiple times during the execution of this function. c3s1|]'‰t‡fd†ˆDƒƒdkVqdS(c3s'|]}ˆ|krdndVqdS(iiN((t.0tc(tv(sƒ/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/community/community_utils.pys %siN(tsum(R(t communities(Rsƒ/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/community/community_utils.pys %s(tall(tGR((Rsƒ/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/community/community_utils.pyRsN(t__doc__t__all__R(((sƒ/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/community/community_utils.pyt s