pub fn deterministic_decompose(
graph: &DynamicGraph,
vertices: &HashSet<VertexId>,
phi: Conductance,
) -> Vec<HashSet<VertexId>>Expand description
Deterministic expander decomposition using trimming
Recursively partitions the graph into φ-expanders by:
- Finding low-conductance cuts using local search
- Removing them (trimming)
- Recursing on remaining components