§
    bŠtj  ã                   ó4   — d dl ZdgZej        d„ ¦   «         ZdS )é    NÚs_metricc                 óx   ‡ — t          t          ˆ fd„‰                      ¦   «         D ¦   «         ¦  «        ¦  «        S )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   ót   •K  — | ]2\  }}‰                      |¦  «        ‰                      |¦  «        z  V — Œ3d S )N)Údegree)Ú.0ÚuÚvÚGs      €úY/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/networkx/algorithms/smetric.pyú	<genexpr>zs_metric.<locals>.<genexpr>   s@   øè è € ÐGÐG±6°A°q�Q—X’X˜a‘[”[ 1§8¢8¨A¡;¤;Ñ.ÐGÐGÐGÐGÐGÐGó    )ÚfloatÚsumÚedges)r
   s   `r   r   r      s8   ø€ õ0 •ÐGÐGÐGÐG¸Q¿WºW¹Y¼YÐGÑGÔGÑGÔGÑHÔHÐHr   )ÚnetworkxÚnxÚ__all__Ú_dispatchabler   © r   r   ú<module>r      sF   ðØ Ð Ð Ð àˆ,€ð ÔðIð Iñ ÔðIð Ið Ir   