Ë
    GìjX  ã                   ó:  — d Z ddlZg d¢Z ej                  d¬«      dd„«       Z ej                  d¬«      dd„«       Z ej                  d¬«      dd„«       Z ej                  d¬«      d	dd
dœd„«       Zej                  d„ «       Z	ej                  dd„«       Z
y)z 
Eigenvalue spectrum of graphs.
é    N)Úlaplacian_spectrumÚadjacency_spectrumÚmodularity_spectrumÚnormalized_laplacian_spectrumÚbethe_hessian_spectrumÚmagnetic_spectrumÚweight)Ú
edge_attrsc                 ó†   — ddl }|j                  j                  t        j                  | |¬«      j                  «       «      S )a¨  Returns eigenvalues of the Laplacian of G

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

    weight : string or None, optional (default='weight')
       The edge data key used to compute each value in the matrix.
       If None, then each edge has weight 1.

    Returns
    -------
    evals : NumPy array
      Eigenvalues

    Notes
    -----
    For MultiGraph/MultiDiGraph, the edges weights are summed.
    See :func:`~networkx.convert_matrix.to_numpy_array` for other options.

    See Also
    --------
    laplacian_matrix

    Examples
    --------
    The multiplicity of 0 as an eigenvalue of the laplacian matrix is equal
    to the number of connected components of G.

    >>> G = nx.Graph()  # Create a graph with 5 nodes and 3 connected components
    >>> G.add_nodes_from(range(5))
    >>> G.add_edges_from([(0, 2), (3, 4)])
    >>> nx.laplacian_spectrum(G)
    array([0., 0., 0., 2., 2.])

    r   N©r	   )ÚscipyÚlinalgÚeigvalshÚnxÚlaplacian_matrixÚtodense©ÚGr	   Úsps      ú\C:\Users\Stabi\Downloads\virtual-tryon(1)\venv\Lib\site-packages\networkx/linalg/spectrum.pyr   r      s3   € óN à�9‰9×Ñœb×1Ñ1°!¸FÔC×KÑKÓMÓNÐNó    c                 ó†   — ddl }|j                  j                  t        j                  | |¬«      j                  «       «      S )a#  Return eigenvalues of the normalized Laplacian of G

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

    weight : string or None, optional (default='weight')
       The edge data key used to compute each value in the matrix.
       If None, then each edge has weight 1.

    Returns
    -------
    evals : NumPy array
      Eigenvalues

    Notes
    -----
    For MultiGraph/MultiDiGraph, the edges weights are summed.
    See to_numpy_array for other options.

    See Also
    --------
    normalized_laplacian_matrix
    r   Nr   )r   r   r   r   Únormalized_laplacian_matrixr   r   s      r   r   r   =   s7   € ó6 à�9‰9×ÑÜ
×&Ñ& q°Ô8×@Ñ@ÓBóð r   c                 ó†   — ddl }|j                  j                  t        j                  | |¬«      j                  «       «      S )a  Returns eigenvalues of the adjacency matrix of G.

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

    weight : string or None, optional (default='weight')
       The edge data key used to compute each value in the matrix.
       If None, then each edge has weight 1.

    Returns
    -------
    evals : NumPy array
      Eigenvalues

    Notes
    -----
    For MultiGraph/MultiDiGraph, the edges weights are summed.
    See to_numpy_array for other options.

    See Also
    --------
    adjacency_matrix
    r   Nr   )r   r   Úeigvalsr   Úadjacency_matrixr   r   s      r   r   r   _   s2   € ó6 à�9‰9×ÑœR×0Ñ0°¸6ÔB×JÑJÓLÓMÐMr   g      Ð?F©Úqr	   Ú
normalizedc                ó’   — ddl }t        j                  | |||¬«      }|j                  j	                  |j                  «       d¬«      S )a¥  Returns eigenvalues of the magnetic laplacian matrix with phase `q`.

    Parameters
    ----------
    G : DiGraph
        Directed graph

    q : float (default=0.25)
        The phase of the magnetic potential is the charge parameter 0 <= q <= 0.5.
        At q=0 returns the standard Laplacian.

    weight : string or None, optional (default='weight')
       The edge data key used to compute each value in the matrix.
       If None, then each edge has weight 1.

    normalized : bool, optional (default=False)
        If True, return the spectrum of the normalized magnetic laplacian matrix.
        If False, use the magnetic laplacian matrix without normalization.

    Returns
    -------
    evals : np.ndarray
        Eigenvalues of the magnetic Laplacian matrix

    Raises
    ------
    NetworkXNotImplemented
        If `G` is undirected or a multigraph.

    See Also
    --------
    magnetic_laplacian_matrix
    r   Nr   T)Úeigvals_only)r   r   Úmagnetic_laplacian_matrixr   ÚeighÚtoarray)r   r   r	   r   r   ÚMLs         r   r   r      s;   € óF ä	×	%Ñ	% a¨1°VÈ
Ô	S€BØ�9‰9�>‰>˜"Ÿ*™*›,°Tˆ>Ó:Ð:r   c                 óâ   — ddl }| j                  «       r.|j                  j                  t	        j
                  | «      «      S |j                  j                  t	        j                  | «      «      S )aª  Returns eigenvalues of the modularity matrix of G.

    Parameters
    ----------
    G : Graph
       A NetworkX Graph or DiGraph

    Returns
    -------
    evals : NumPy array
      Eigenvalues

    See Also
    --------
    modularity_matrix

    References
    ----------
    .. [1] M. E. J. Newman, "Modularity and community structure in networks",
       Proc. Natl. Acad. Sci. USA, vol. 103, pp. 8577-8582, 2006.
    r   N)r   Úis_directedr   r   r   Údirected_modularity_matrixÚmodularity_matrix)r   r   s     r   r   r   ¨   sP   € ó. à‡}�}„Ø�y‰y× Ñ ¤×!>Ñ!>¸qÓ!AÓBÐBà�y‰y× Ñ ¤×!5Ñ!5°aÓ!8Ó9Ð9r   c                 ó„   — ddl }|j                  j                  t        j                  | |«      j                  «       «      S )uþ  Returns eigenvalues of the Bethe Hessian matrix of G.

    Parameters
    ----------
    G : Graph
       A NetworkX Graph or DiGraph

    r : float
       Regularizer parameter

    Returns
    -------
    evals : NumPy array
      Eigenvalues

    See Also
    --------
    bethe_hessian_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.
    r   N)r   r   r   r   Úbethe_hessian_matrixr   )r   Úrr   s      r   r   r   Ç   s2   € ó6 à�9‰9×Ñœb×5Ñ5°a¸Ó;×CÑCÓEÓFÐFr   r   )N)Ú__doc__Únetworkxr   Ú__all__Ú_dispatchabler   r   r   r   r   r   © r   r   Ú<module>r2      sÞ   ðñó ò€ð €×Ñ˜XÔ&ò(Oó 'ð(OðV €×Ñ˜XÔ&òó 'ððB €×Ñ˜XÔ&òNó 'ðNð> €×Ñ˜XÔ&Ø"¨8Àó %;ó 'ð%;ðP ×Ññ:ó ð:ð< ×ÑòGó ñGr   