import { Graph } from "./Graph";
/**
 * Class dedicated to spectral clustering :
 * * compute the eigen values
 * * sort the eigen vectors accorting to the eigen values
 * * focus on the 2nd eiven vector (Fiedler's)
 * * run a k-means to cluster the components of the Fiedler's vector
 */
export declare class SpectralClustering {
    private graph;
    constructor(graph: Graph);
    compute(options?: Map<string, string | number>): void;
    private extractStrictLaplacianMatrix;
    /**
     * Build a matrix showing the distance of nodes
     */
    private extractDistanceLaplacianMatrix;
}