Struct DeterministicLocalKCut 

pub struct DeterministicLocalKCut { /* private fields */ }

Deterministic LocalKCut data structure Per Theorem 4.1 of the paper

Implementations

impl DeterministicLocalKCut

pub fn new(lambda_max: u64, nu: usize, beta: usize) -> Self

Create new LocalKCut structure

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

Insert an edge

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

Delete an edge

pub fn query(&self, v: VertexId) -> Vec<LocalCut>

Query: Find all cuts containing vertex v with volume ≤ ν and cut-size ≤ λ_max This is Algorithm 4.1 from the paper

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

Get all vertices

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

Get neighbors of a vertex

Trait Implementations

impl Debug for DeterministicLocalKCut

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

Formats the value using the given formatter.