+
    �°³j  ã                   ó8   € ^ RI tR.t]P                  R 4       tR# )é    NÚs_metricc                ó\   a € \        \        V 3R lS P                  4        4       4      4      # )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   óv   <"  € T F.  w  rSP                  V4      SP                  V4      ,          x € K0  	  R # 5i)N)Údegree)Ú.0ÚuÚvÚGs   &  €Ú\/home/luca/screen-checking/.venv/lib/python3.14/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   ƒ69)ÚfloatÚsumÚedges)r
   s   fr   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   