Ë
    D^(h  ã                   óV   — d Z ddlmZ ddlZdgZ ej                  d¬«      dd„«       Zy)	z;Functions for computing the harmonic centrality of a graph.é    )ÚpartialNÚharmonic_centralityÚdistance)Ú
edge_attrsc                 ó&  — t        |�| j                  |«      n| j                  «      }t        |�| j                  |«      n| j                  «      }|D �ci c]  }|d“Œ }}d}t        |«      t        |«      k  r2d}||}}t	        j
                  | «      rt	        j                  | d¬«      } t        t        j                  | |¬«      }|D ]?  } ||«      }	|j                  |	«      D ]!  }|	|   }
|
dk(  rŒ||r|n|xx   d|
z  z  cc<   Œ# ŒA |S c c}w )a%  Compute harmonic centrality for nodes.

    Harmonic centrality [1]_ of a node `u` is the sum of the reciprocal
    of the shortest path distances from all other nodes to `u`

    .. math::

        C(u) = \sum_{v \neq u} \frac{1}{d(v, u)}

    where `d(v, u)` is the shortest-path distance between `v` and `u`.

    If `sources` is given as an argument, the returned harmonic centrality
    values are calculated as the sum of the reciprocals of the shortest
    path distances from the nodes specified in `sources` to `u` instead
    of from all nodes to `u`.

    Notice that higher values indicate higher centrality.

    Parameters
    ----------
    G : graph
      A NetworkX graph

    nbunch : container (default: all nodes in G)
      Container of nodes for which harmonic centrality values are calculated.

    sources : container (default: all nodes in G)
      Container of nodes `v` over which reciprocal distances are computed.
      Nodes not in `G` are silently ignored.

    distance : edge attribute key, optional (default=None)
      Use the specified edge attribute as the edge distance in shortest
      path calculations.  If `None`, then each edge will have distance equal to 1.

    Returns
    -------
    nodes : dictionary
      Dictionary of nodes with harmonic centrality as the value.

    See Also
    --------
    betweenness_centrality, load_centrality, eigenvector_centrality,
    degree_centrality, closeness_centrality

    Notes
    -----
    If the 'distance' keyword is set to an edge attribute key then the
    shortest-path length will be computed using Dijkstra's algorithm with
    that edge attribute as the edge weight.

    References
    ----------
    .. [1] Boldi, Paolo, and Sebastiano Vigna. "Axioms for centrality."
           Internet Mathematics 10.3-4 (2014): 222-262.
    r   FT)Úcopy)Úweighté   )
ÚsetÚnbunch_iterÚnodesÚlenÚnxÚis_directedÚreverser   Úshortest_path_lengthÚintersection)ÚGÚnbunchr   ÚsourcesÚuÚ
centralityÚ
transposedÚsplÚvÚdistÚds              úe/var/www/skyplay_api_hub/venv/lib/python3.12/site-packages/networkx/algorithms/centrality/harmonic.pyr   r   
   s  € ôt ¨&Ð*<�—‘˜vÔ&À!Ç'Á'ÓJ€FÜ¨GÐ,?�!—-‘- Ô(ÀQÇWÁWÓM€Gà &Ö'˜1�!�Q‘$Ð'€JÐ'à€JÜ
ˆ6ƒ{”S˜“\Ò!Øˆ
Ø! 6�ˆÜ�>‰>˜!ÔÜ—
‘
˜1 5Ô)ˆAä
”"×)Ñ)¨1°XÔ
>€CØò 8ˆÙ�1‹vˆØ×$Ñ$ TÓ*ò 	8ˆAØ�Q‘ˆAØ�AŠvØØ™J‘q¨AÓ.°!°a±%Ñ7Ô.ñ		8ð8ð Ðùò% (s   Á
D)NNN)Ú__doc__Ú	functoolsr   Únetworkxr   Ú__all__Ú_dispatchabler   © ó    r   ú<module>r&      s9   ðÙ Aå ã à Ð
!€ð €×Ñ˜ZÔ(òNó )ñNr%   