pub fn spectral_partition<N, E>(
graph: &Graph<N, E>,
) -> (Vec<NodeId>, Vec<NodeId>)Expand description
Spectral bisection using the Fiedler vector (2nd smallest eigenvector of Laplacian). Nodes with Fiedler value < median go to partition A, rest to partition B.