ó
    …~iŒ  ã                   ó:   • S r SSKrS/r\R                  S 5       rg)z2Helper functions for community-finding algorithms.é    NÚis_partitionc                 ó  • [        U[        5      (       d  [        U5      nU VVs1 s H  o"  H  o3U ;   d  M
  UiM     M     nnn[        U 5      [        U5      s=:H  =(       a    [        S U 5       5      :H  $ s  $ s  snnf )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.

c              3   ó8   #   • U  H  n[        U5      v •  M     g 7f)N)Úlen)Ú.0Úcs     Új/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/algorithms/community/community_utils.pyÚ	<genexpr>Úis_partition.<locals>.<genexpr>   s   é € Ð&C²{°!¤s¨1§v v²{ùs   ‚)Ú
isinstanceÚlistr   Úsum)ÚGÚcommunitiesr   ÚnÚnodess        r	   r   r      sl   € ô$ �k¤4×(Ñ(Ü˜;Ó'ˆÙ#Ô9š�1«Q¨°q±&�Q©Q‰Q™€EÑ9äˆq‹6”S˜“Z×CÓC¤3Ñ&C±{Ó&CÓ#CÑCÐCÑCÐCùó :s
   ¦A<¸
A<)Ú__doc__ÚnetworkxÚnxÚ__all__Ú_dispatchabler   © ó    r	   Ú<module>r      s/   ðÙ 8ã àÐ
€ð ×ÑñDó ñDr   