@graphty/algorithms / index / SpectralClusteringOptions

Interface: SpectralClusteringOptions

Defined in: clustering/spectral.ts:15

Spectral Clustering implementation

Uses eigenvalues and eigenvectors of the graph Laplacian matrix to perform clustering. Particularly effective for finding non-convex clusters and communities in graphs.

Time complexity: O(V³) for eigendecomposition Space complexity: O(V²)

Properties

k

k: number

Defined in: clustering/spectral.ts:16

---

laplacianType?

optional laplacianType: "normalized" | "unnormalized" | "randomWalk"

Defined in: clustering/spectral.ts:17

---

maxIterations?

optional maxIterations: number

Defined in: clustering/spectral.ts:18

---

seed?

optional seed: number

Defined in: clustering/spectral.ts:20

---

tolerance?

optional tolerance: number

Defined in: clustering/spectral.ts:19