pub fn recursive_bisection<N: Clone, E: Clone>( graph: &Graph<N, E>, depth: usize, ) -> Vec<Vec<NodeId>>
Recursive bisection: repeatedly partition each part.