ó
    …~i  ã                   ó6   • S SK rS/r\R                  S 5       rg)é    NÚs_metricc                 ó\   ^ • [        [        U 4S jT R                  5        5       5      5      $ )a  Returns the s-metric [1]_ of graph.

The s-metric is defined as the sum of the products ``deg(u) * deg(v)``
for every edge ``(u, v)`` in `G`.

Parameters
----------
G : graph
    The graph used to compute the s-metric.

Returns
-------
s : float
    The s-metric of the graph.

References
----------
.. [1] Lun Li, David Alderson, John C. Doyle, and Walter Willinger,
       Towards a Theory of Scale-Free Graphs:
       Definition, Properties, and  Implications (Extended Version), 2005.
       https://arxiv.org/abs/cond-mat/0501169
c              3   ón   >#   • U  H*  u  pTR                  U5      TR                  U5      -  v •  M,     g 7f)N)Údegree)Ú.0ÚuÚvÚGs      €ÚX/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/algorithms/smetric.pyÚ	<genexpr>Ús_metric.<locals>.<genexpr>   s(   øé € ÐGºY±6°A�Q—X‘X˜a“[ 1§8¡8¨A£;Ö.ºYùs   ƒ25)ÚfloatÚsumÚedges)r
   s   `r   r   r      s!   ø€ ô0 ”ÔG¸Q¿W¹W¼YÓGÓGÓHÐHó    )ÚnetworkxÚnxÚ__all__Ú_dispatchabler   © r   r   Ú<module>r      s+   ðÛ àˆ,€ð ×ÑñIó ñIr   