Struct ProgressComplex 

pub struct ProgressComplex {
    pub n: usize,
    pub m: usize,
    /* private fields */
}

The progress complex of two processes of lengths n, m (an n × m grid of cells), with a set of forbidden cells (the mutual-exclusion region) left unfilled.

Fields

n: usize

m: usize

Implementations

impl ProgressComplex

pub fn new(n: usize, m: usize, forbidden: &[(usize, usize)]) -> Self

pub fn betti(&self) -> (usize, usize, usize)

The Betti numbers (β₀, β₁, β₂) of the closure of the allowed cells — vertices and edges are included exactly when they bound some allowed cell, so removing a forbidden region opens a real hole. Homology over GF(2), fully computed (no shortcuts).

pub fn euler(&self) -> i64

χ = #V − #E + #C over the closure of the allowed cells.