Struct ZigzagPersistence 

pub struct ZigzagPersistence { /* private fields */ }

Incremental zigzag persistence computation.

Maintains the current filtration and reduced boundary matrix, updating persistance intervals as simplices are added and removed.

Implementations

impl ZigzagPersistence

pub fn new() -> Self

Create a new empty zigzag persistence structure.

pub fn add_simplex(&mut self, s: Simplex) -> Vec<(f64, f64, usize)>

Process a forward step: add a simplex and return any newly closed intervals.

In standard persistence, adding a simplex either:

• Creates a new homology class (no pivot after reduction) → opens an interval.
• Destroys an existing class (reduction yields a pivot) → closes an interval.

pub fn remove_simplex(&mut self, s: Simplex) -> Vec<(f64, f64, usize)>

Process a backward step: remove a simplex and return any newly closed intervals.

To remove simplex s at position pos, we perform adjacent transpositions (vineyard updates) to bubble it to the last position, then delete it.

After removal, if s had an open interval it gets closed with death = infinity (the feature survives through the deletion). If s was killing another class, the killed class re-opens.

pub fn pairs(&self) -> &[(f64, f64, usize)]

Return all completed persistence pairs collected so far.

Trait Implementations

impl Clone for ZigzagPersistence

fn clone(&self) -> ZigzagPersistence

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ZigzagPersistence

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

Formats the value using the given formatter.

impl Default for ZigzagPersistence

fn default() -> Self

Returns the “default value” for a type.