Rips complex reference manual

class gudhi.RipsComplex

Bases: object

The data structure is a one skeleton graph, or Rips graph, containing edges when the edge length is less or equal to a given threshold. Edge length is computed from a user given point cloud with a given distance function, or a distance matrix.

__init__()

RipsComplex constructor.

Parameters

  • max_edge_length (float) – Rips value.

  • points (list of list of double) – A list of points in d-Dimension.

Or

Parameters

distance_matrix – A distance matrix (full square or lower triangular).

And in both cases

Parameters

sparse (float) – If this is not None, it switches to building a sparse Rips and represents the approximation parameter epsilon.

create_simplex_tree()
Parameters

max_dimension (int) – graph expansion for rips until this given maximal dimension.

Returns

A simplex tree created from the Delaunay Triangulation.

Return type

SimplexTree

Weighted Rips complex reference manual

class gudhi.weighted_rips_complex.WeightedRipsComplex(distance_matrix, weights=None, max_filtration=inf)[source]

Bases: object

Class to generate a weighted Rips complex from a distance matrix and weights on vertices, in the way described in [1]. Remark that all the filtration values are doubled compared to the definition in the paper for the consistency with RipsComplex.

__init__(distance_matrix, weights=None, max_filtration=inf)[source]
Parameters

  • distance_matrix (Sequence[Sequence[float]]) – distance matrix (full square or lower triangular).

  • weights (Sequence[float]) – (one half of) weight for each vertex.

  • max_filtration (float) – specifies the maximal filtration value to be considered.

create_simplex_tree(max_dimension)[source]
Parameters

max_dimension (int) – graph expansion until this given dimension.