Crate filtration_domination

Algorithms and utilities to work with bifiltered graphs. In particular, algorithms to remove edges from a bifiltered graph while maintaining the topological properties of its clique complex, see crate::removal.

Modules

datasets

Dataset reading and sampling.

distance_matrix

Distance matrices: reading them, outputting them, and handling them, including density estimation.

edges

Edges, edge lists, and associated functions.

mpfree

Interface with mpfree that allows to compute minimal presentations.

points

Point clouds: create and modify them.

removal

Algorithms to remove edges from a bifiltered graph while maintaining the topological properties of its clique complex, as described in the paper “Filtration-Domination in Bifiltered Graphs”.

Structs

OneCriticalGrade

A 1-critical grade. The default order is lexicographic.

Traits

CriticalGrade

The grade in which a simplex enters a filtration.

Value

A generic value, like usize or i32, that we can use as grades in a bifiltered graph.