Expand description
Spectral graph theory operations
This module provides functions for spectral graph analysis, including Laplacian matrices, spectral clustering, and eigenvalue-based graph properties.
Features SIMD acceleration for performance-critical operations.
Enums§
- Laplacian
Type - Laplacian matrix type
Functions§
- algebraic_
connectivity - Computes the algebraic connectivity (Fiedler value) of a graph
- laplacian
- Computes the Laplacian matrix of a graph
- laplacian_
digraph - Computes the Laplacian matrix of a directed graph
- normalized_
cut - Computes the normalized cut value for a given partition
- spectral_
clustering - Performs spectral clustering on a graph
- spectral_
radius - Computes the spectral radius of a graph