23 #ifndef INCLUDE_RIPS_COMPLEX_INTERFACE_H_ 24 #define INCLUDE_RIPS_COMPLEX_INTERFACE_H_ 26 #include <gudhi/Simplex_tree.h> 27 #include <gudhi/Rips_complex.h> 30 #include "Simplex_tree_interface.h" 39 namespace rips_complex {
41 class Rips_complex_interface {
42 using Point_d = std::vector<double>;
43 using Distance_matrix = std::vector<std::vector<Simplex_tree_interface<>::Filtration_value>>;
46 Rips_complex_interface(
const std::vector<std::vector<double>>& values,
double threshold,
bool euclidean) {
57 ~Rips_complex_interface() {
61 void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
int dim_max) {
63 simplex_tree->initialize_filtration();
74 #endif // INCLUDE_RIPS_COMPLEX_INTERFACE_H_ void create_complex(SimplicialComplexForRips &complex, int dim_max)
Initializes the simplicial complex from the Rips graph and expands it until a given maximal dimension...
Definition: Rips_complex.h:113
Compute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to have the same dimension.
Definition: distance_functions.h:46
Definition: SimplicialComplexForAlpha.h:26
Rips complex data structure.
Definition: Rips_complex.h:57
Global distance functions.