Struct Fragmentation 

pub struct Fragmentation { /* private fields */ }

The Fragmentation algorithm data structure

Implementations

impl Fragmentation

pub fn new(config: FragmentationConfig) -> Self

Create new fragmentation structure

pub fn with_defaults() -> Self

Create with default config

pub fn insert_edge(&mut self, u: VertexId, v: VertexId, weight: Weight)

Insert an edge into the graph

pub fn delete_edge(&mut self, u: VertexId, v: VertexId)

Delete an edge from the graph

pub fn vertices(&self) -> Vec<VertexId>

Get all vertices

pub fn neighbors(&self, v: VertexId) -> Vec<(VertexId, Weight)>

Get neighbors of a vertex

pub fn degree(&self, v: VertexId) -> usize

Compute degree of a vertex

pub fn fragment(&mut self) -> Vec<u64>

Run the fragmentation algorithm to decompose the graph

This implements the recursive decomposition from the paper.

pub fn trim(&self, vertices: &[VertexId]) -> TrimResult

Trim subroutine: Find a boundary-sparse cut

Algorithm (per Theorem 5.1):

1. Start with high-degree vertices
2. Greedily expand the set
3. Stop when boundary becomes sparse relative to volume

pub fn is_expander(&self, fragment_id: u64) -> bool

Check if a fragment is a φ-expander

A graph is a φ-expander if every cut (S, S̄) has: |∂S| ≥ φ · min(vol(S), vol(S̄))

pub fn get_fragment(&self, id: u64) -> Option<&Fragment>

Get a fragment by ID

pub fn get_vertex_fragment(&self, v: VertexId) -> Option<&Fragment>

Get fragment containing a vertex

pub fn leaf_fragments(&self) -> Vec<&Fragment>

Get all leaf fragments (no children)

pub fn num_fragments(&self) -> usize

Get total number of fragments

pub fn max_depth(&self) -> usize

Get the fragment hierarchy depth

Trait Implementations

impl Debug for Fragmentation

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Fragmentation

fn default() -> Self

Returns the “default value” for a type.