Crate neco_spectral 

Spectral clustering via normalized Laplacian, LOBPCG, and k-means.

Structs

SpectralResult

Result of spectral clustering.

Functions

count_cut_edges

Count edges that cross between part_a and part_b.

kl_refine

Improve a bisection with Kernighan-Lin swaps.

recursive_partition

Recursively bisect a graph until every partition has at most target_size nodes.

spectral_bisect

Split an unweighted graph into two parts using the Fiedler vector of the graph Laplacian.

spectral_cluster

Cluster nodes of a weighted adjacency graph.