diff options
author | MathieuCarriere <mathieu.carriere3@gmail.com> | 2022-02-16 15:20:16 +0100 |
---|---|---|
committer | MathieuCarriere <mathieu.carriere3@gmail.com> | 2022-02-16 15:20:16 +0100 |
commit | 3d78c677dfe4aa8515934ab2494fd6faaad0bc67 (patch) | |
tree | f57db31c50c60f2f2182de4b3e562af228efb8e6 /src/python/gudhi | |
parent | fe3fb13a1a824ef0c915d626344d868eef6ecdcd (diff) | |
parent | 1c1f8b98b37322d728d8a226e9ec04e21f995b42 (diff) |
Merge branch 'master' of https://github.com/GUDHI/gudhi-devel into diff
Diffstat (limited to 'src/python/gudhi')
-rw-r--r-- | src/python/gudhi/weighted_rips_complex.py | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/src/python/gudhi/weighted_rips_complex.py b/src/python/gudhi/weighted_rips_complex.py index 0541572b..16f63c3d 100644 --- a/src/python/gudhi/weighted_rips_complex.py +++ b/src/python/gudhi/weighted_rips_complex.py @@ -12,9 +12,11 @@ from gudhi import SimplexTree class WeightedRipsComplex: """ Class to generate a weighted Rips complex from a distance matrix and weights on vertices, - in the way described in :cite:`dtmfiltrations`. + in the way described in :cite:`dtmfiltrations` with `p=1`. The filtration value of vertex `i` is `2*weights[i]`, + and the filtration value of edge `ij` is `distance_matrix[i][j]+weights[i]+weights[j]`, + or the maximum of the filtrations of its extremities, whichever is largest. Remark that all the filtration values are doubled compared to the definition in the paper - for the consistency with RipsComplex. + for consistency with RipsComplex. """ def __init__(self, distance_matrix, |