Struct DegreePresparse 

pub struct DegreePresparse { /* private fields */ }

Degree-based presparse implementation

Uses effective resistance approximation R_eff(u,v) ≈ 1/(deg_u × deg_v) to pre-filter edges before exact sparsification, achieving 5.9x speedup.

Implementations

impl DegreePresparse

pub fn new() -> Self

Create new degree presparse with default config

pub fn with_config(config: PresparseConfig) -> Self

Create with custom config

pub fn effective_resistance(&self, deg_u: usize, deg_v: usize) -> f64

Compute effective resistance approximation for an edge

R_eff(u,v) ≈ 1 / (deg(u) × deg(v))

High resistance = edge is important for connectivity Low resistance = edge can likely be removed

pub fn presparse(&mut self, graph: &DynamicGraph) -> PresparseResult

Perform degree-based presparse on a graph

Returns a sparsified edge set that preserves spectral properties for minimum cut computation.

pub fn should_include_edge( &mut self, graph: &DynamicGraph, u: VertexId, v: VertexId, ) -> bool

Incremental update: handle edge insertion

Returns whether the edge should be included in the sparse graph

pub fn config(&self) -> &PresparseConfig

Get statistics for the presparse

Trait Implementations

impl Default for DegreePresparse

fn default() -> Self

Returns the “default value” for a type.