
    \Mh
                         d Z ddlZddlmZ dgZ ed           ed          ej        dd                                    ZdS )	z5Bethe Hessian or deformed Laplacian matrix of graphs.    N)not_implemented_forbethe_hessian_matrixdirected
multigraphc           	      N   ddl }|t          |           }|Zt          d t          j        |           D                       t          d t          j        |           D                       z  dz
  }t          j        | |d          }|j        \  }}|j                            |j        	                    |                    d          d||d	                    }|j                            |j        
                    ||d	                    }|d
z  dz
  |z  ||z  z
  |z   S )u  Returns the Bethe Hessian matrix of G.

    The Bethe Hessian is a family of matrices parametrized by r, defined as
    H(r) = (r^2 - 1) I - r A + D where A is the adjacency matrix, D is the
    diagonal matrix of node degrees, and I is the identify matrix. It is equal
    to the graph laplacian when the regularizer r = 1.

    The default choice of regularizer should be the ratio [2]_

    .. math::
      r_m = \left(\sum k_i \right)^{-1}\left(\sum k_i^2 \right) - 1

    Parameters
    ----------
    G : Graph
       A NetworkX graph
    r : float
       Regularizer parameter
    nodelist : list, optional
       The rows and columns are ordered according to the nodes in nodelist.
       If nodelist is None, then the ordering is produced by ``G.nodes()``.

    Returns
    -------
    H : scipy.sparse.csr_array
      The Bethe Hessian matrix of `G`, with parameter `r`.

    Examples
    --------
    >>> k = [3, 2, 2, 1, 0]
    >>> G = nx.havel_hakimi_graph(k)
    >>> H = nx.bethe_hessian_matrix(G)
    >>> H.toarray()
    array([[ 3.5625, -1.25  , -1.25  , -1.25  ,  0.    ],
           [-1.25  ,  2.5625, -1.25  ,  0.    ,  0.    ],
           [-1.25  , -1.25  ,  2.5625,  0.    ,  0.    ],
           [-1.25  ,  0.    ,  0.    ,  1.5625,  0.    ],
           [ 0.    ,  0.    ,  0.    ,  0.    ,  0.5625]])

    See Also
    --------
    bethe_hessian_spectrum
    adjacency_matrix
    laplacian_matrix

    References
    ----------
    .. [1] A. Saade, F. Krzakala and L. Zdeborová
       "Spectral Clustering of Graphs with the Bethe Hessian",
       Advances in Neural Information Processing Systems, 2014.
    .. [2] C. M. Le, E. Levina
       "Estimating the number of communities in networks by spectral methods"
       arXiv:1507.00827, 2015.
    r   Nc              3   &   K   | ]\  }}|d z  V  dS )   N .0vds      b/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/networkx/linalg/bethehessianmatrix.py	<genexpr>z'bethe_hessian_matrix.<locals>.<genexpr>H   s*      ..A1......    c              3       K   | ]	\  }}|V  
d S )Nr
   r   s      r   r   z'bethe_hessian_matrix.<locals>.<genexpr>H   s&      4P4P41aQ4P4P4P4P4P4Pr      csr)nodelistformat)axis)r   r	   )scipylistsumnxdegreeto_scipy_sparse_arrayshapesparse	csr_arrayspdiagseye)	Grr   spAnmDIs	            r   r   r   	   s   t 77y..1.....4P4P29Q<<4P4P4P1P1PPSTT
 XeDDDA7DAq
	BI--aeeemmQ1U-SSTTA
	BIMM!QuM==>>AqD1H>AE!A%%r   )NN)__doc__networkxr   networkx.utilsr   __all___dispatchabler   r
   r   r   <module>r0      s    ; ;     . . . . . .!
" Z  \""C& C& C&  #" ! C& C& C&r   