Module partition 

Functions

kernighan_lin

Kernighan-Lin refinement: iteratively swap pairs of nodes between partitions to minimize edge cut.

partition_quality

Partition quality: ratio of edges cut to total edges. Lower is better (fewer inter-partition edges).

recursive_bisection

Recursive bisection: repeatedly partition each part.

spectral_partition

Spectral bisection using the Fiedler vector (2nd smallest eigenvector of Laplacian). Nodes with Fiedler value < median go to partition A, rest to partition B.