Struct StubInstance 

pub struct StubInstance { /* private fields */ }

Stub instance that does brute-force min cut computation

This implementation:

• Stores a local copy of all edges
• Enumerates all proper subsets on each query
• Checks connectivity via BFS
• Computes exact boundary values

Performance

• Query: O(2^n · m) where n = vertices, m = edges
• Only practical for n < 20

Purpose

Used as a reference implementation to test the wrapper logic before the real LocalKCut algorithm is ready.

Implementations

impl StubInstance

pub fn new(graph: &DynamicGraph, lambda_min: u64, lambda_max: u64) -> Self

Create a new stub instance with initial graph state

This is used for direct testing. The wrapper should use init() instead.

pub fn new_empty(lambda_min: u64, lambda_max: u64) -> Self

Create an empty stub instance for use with the wrapper

The wrapper will apply all edges via apply_inserts/apply_deletes.

Trait Implementations

impl ProperCutInstance for StubInstance

fn init(_graph: &DynamicGraph, lambda_min: u64, lambda_max: u64) -> Self

Initialize instance on graph with given bounds

fn apply_inserts(&mut self, edges: &[(EdgeId, VertexId, VertexId)])

Apply batch of edge insertions

fn apply_deletes(&mut self, edges: &[(EdgeId, VertexId, VertexId)])

Apply batch of edge deletions

fn query(&mut self) -> InstanceResult

Query current minimum proper cut

fn bounds(&self) -> (u64, u64)

Get the lambda bounds for this instance