gudhi.weighted_rips_complex.WeightedRipsComplex Class Reference

Public Member Functions

def __init__ (self, distance_matrix, weights=None, max_filtration=float('inf'))
 
def create_simplex_tree (self, max_dimension)
 

Detailed Description

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

Constructor & Destructor Documentation

◆ __init__()

def gudhi.weighted_rips_complex.WeightedRipsComplex.__init__ (   self,
  distance_matrix,
  weights = None,
  max_filtration = float('inf') 
)
Args:
    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.      

Member Function Documentation

◆ create_simplex_tree()

def gudhi.weighted_rips_complex.WeightedRipsComplex.create_simplex_tree (   self,
  max_dimension 
)
Args:
    max_dimension (int): graph expansion until this given dimension.

The documentation for this class was generated from the following file:
GUDHI  Version 3.3.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : MIT Generated on Tue Aug 11 2020 11:58:59 for GUDHI by Doxygen 1.8.18