Struct CubicalComplex 

pub struct CubicalComplex { /* private fields */ }

A cubical complex, stored as the cells of each dimension 0..=dim.

Implementations

impl CubicalComplex

pub fn from_top_cells(top: Vec<Cube>) -> Self

Build from filled top-dimensional cells, taking the downward closure (all faces of all faces).

pub fn progress(lengths: &[usize], forbidden: &[Vec<usize>]) -> Self

The progress complex of d processes with the given step lengths: every grid d-cell is filled, except those in forbidden (the mutual-exclusion / synchronization region).

pub fn dim(&self) -> usize

pub fn num_cells(&self, k: usize) -> usize

pub fn betti(&self) -> Vec<usize>

The Betti vector (β₀, …, β_d): β_k = #C_k − rank ∂_k − rank ∂_{k+1} over GF(2).

pub fn euler(&self) -> i64

χ = Σ (−1)^k #C_k — the alternating cell count, equal to Σ (−1)^k β_k (Euler–Poincaré).