
    h                     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      M/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/smetric.py	<genexpr>s_metric.<locals>.<genexpr>   s(     GY6AQXXa[188A;.Ys   25)floatsumedges)r
   s   `r   r   r      s!    0 GQWWYGGHH    )networkxnx__all___dispatchabler    r   r   <module>r      s+    , I Ir   