#include <iostream>
using Index = Zigzag_persistence::Index;
int main() {
std::clog << "************* Minimalistic example of usage of the Zigzag_persistence class *************" << std::endl;
std::cout << "[" << dim << "] " << birth << " - " << death << std::endl;
});
zp.insert_cell({}, 0);
zp.insert_cell({0, 1}, 1);
zp.insert_cell({}, 0);
zp.insert_cell({0, 3}, 1);
zp.insert_cell({1, 3}, 1);
zp.remove_cell(4);
zp.remove_cell(2);
zp.get_current_infinite_intervals(
[](Dimension dim, Index birth) { std::cout << "[" << dim << "] " << birth << " - inf" << std::endl; });
return 0;
}
Class computing the zigzag persistent homology of a zigzag filtration. Algorithm based on .
Definition: filtered_zigzag_persistence.h:442
typename Options::Dimension Dimension
Definition: filtered_zigzag_persistence.h:448
Internal_key insert_cell(Cell_key cellID, const BoundaryRange &boundary, Dimension dimension, Filtration_value filtrationValue)
Updates the zigzag persistence diagram after the insertion of the given cell.
Definition: filtered_zigzag_persistence.h:498
Class computing the zigzag persistent homology of a zigzag sequence. Algorithm based on .
Definition: zigzag_persistence.h:149
Contains the implementation of the Gudhi::zigzag_persistence::Zigzag_persistence class.