+
    �°³j/  ã                   óH   € ^ RI Ht ^ RItR.t]P
                  RR l4       tR# )é    )ÚcombinationsNÚ
dispersionc                ó°  aaaa€ VVVV3R lpVf{   Vf>   V  Uu/ uF  qˆ/ bK  	  p	pV  F$  pW,           F  pV! WV4      W‘,          V&   K  	  K&  	  V	# \         P                  W,          / 4      p	W,           F  pV! WV4      W‘&   K  	   V	# Vf9   \         P                  W,          / 4      p	W,           F  pV! WV4      W’&   K  	  V	# V! WV4      p	V	# u upi )a	  Calculate dispersion between `u` and `v` in `G`.

A link between two actors (`u` and `v`) has a high dispersion when their
mutual ties (`s` and `t`) are not well connected with each other.

Parameters
----------
G : graph
    A NetworkX graph.
u : node, optional
    The source for the dispersion score (e.g. ego node of the network).
v : node, optional
    The target of the dispersion score if specified.
normalized : bool
    If True (default) normalize by the embeddedness of the nodes (u and v).
alpha, b, c : float
    Parameters for the normalization procedure. When `normalized` is True,
    the dispersion value is normalized by::

        result = ((dispersion + b) ** alpha) / (embeddedness + c)

    as long as the denominator is nonzero.

Returns
-------
nodes : dictionary
    If u (v) is specified, returns a dictionary of nodes with dispersion
    score for all "target" ("source") nodes. If neither u nor v is
    specified, returns a dictionary of dictionaries for all nodes 'u' in the
    graph with a dispersion score for each node 'v'.

Notes
-----
This implementation follows Lars Backstrom and Jon Kleinberg [1]_. Typical
usage would be to run dispersion on the ego network $G_u$ if $u$ were
specified.  Running :func:`dispersion` with neither $u$ nor $v$ specified
can take some time to complete.

References
----------
.. [1] Romantic Partnerships and the Dispersion of Social Ties:
    A Network Analysis of Relationship Status on Facebook.
    Lars Backstrom, Jon Kleinberg.
    https://arxiv.org/pdf/1310.6753v1.pdf

c                óÊ  <€ \        W,          4      pW,           Uu0 uF  qDV9   g   K  VkK  	  ppW0p\        V^4      p^ pV FS  w  ršVP                  W	,          4      V,
          pW«9  g   K+  VP                  W
,          4      '       g   KJ  V^,          pKU  	  \	        V4      pTpS'       d.   VS,           S,          pVS,           ^ 8w  d   WÜS,           ,          pV# u upi )z=dispersion for all nodes 'v' in a ego network G_u of node 'u')Úsetr   ÚintersectionÚ
isdisjointÚlen)ÚG_uÚuÚvÚu_nbrsÚnÚSTÚset_uvÚpossibÚtotalÚsÚtÚnbrs_sÚembeddednessÚdispersion_valÚalphaÚbÚcÚ
normalizeds   &&&           €€€€Új/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/centrality/dispersion.pyÚ_dispersionÚdispersion.<locals>._dispersion9   sÌ   ø€ ä�S•V“ˆØžÓ/™�A¨¡;�aˆa™ˆÐ/Ø�ˆä˜b !Ó$ˆØˆÛ‰DˆAà×(Ñ(¨­Ó0°6Õ9ˆFàŽà×$Ñ$ S¥V×,Ô,à˜Q•J’Eñ ô ˜2“wˆàˆßØ# a�i¨EÕ1ˆNØ˜aÕ 1Ô$Ø°Õ"2Õ2�àÐùò/ 0s
   �C ªC )ÚdictÚfromkeys)
ÚGr   r   r   r   r   r   r   r   Úresultss
   &&&ffff   r   r   r      sì   û€ ÷bð ð8 	‚yàŠ9Ù&'Ó(¡a ˜"’u¡aˆGÐ(Û�ØŸ˜�AÙ$/°°aÓ$8�G•J˜q“Mó ñ ð$ €Nô —m‘m A¥D¨"Ó-ˆGØ—T�T�Ù(¨¨qÓ1�“
ò ð €Nð Š9Ü—m‘m A¥D¨"Ó-ˆGØ—T�T�Ù(¨¨qÓ1�“
ñ ð €Nñ " !¨Ó*ˆGà€Nùò' )s   šC)NNTg      ð?ç        r$   )Ú	itertoolsr   ÚnetworkxÚnxÚ__all__Ú_dispatchabler   © ó    r   Ú<module>r,      s.   ðÝ "ã àˆ.€ð ×Ñóbó òbr+   