pub fn partition_quality<N, E>( graph: &Graph<N, E>, parts: &[Vec<NodeId>], ) -> f32
Partition quality: ratio of edges cut to total edges. Lower is better (fewer inter-partition edges).