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> 28 #include <gudhi/Points_off_io.h> 32 #include "Simplex_tree_interface.h" 41 namespace rips_complex {
43 class Rips_complex_interface {
44 using Point_d = std::vector<double>;
45 using Distance_matrix = std::vector<std::vector<Simplex_tree_interface<>::Filtration_value>>;
48 Rips_complex_interface(
const std::vector<std::vector<double>>& values,
double threshold,
bool euclidean) {
59 Rips_complex_interface(
const std::string& file_name,
double threshold,
bool euclidean,
bool from_file =
true) {
68 Distance_matrix distances =
69 Gudhi::read_lower_triangular_matrix_from_csv_file<Simplex_tree_interface<>::Filtration_value>(file_name);
74 ~Rips_complex_interface() {
78 void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
int dim_max) {
80 simplex_tree->initialize_filtration();
91 #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
OFF file reader implementation in order to read points from an OFF file.
Definition: Points_off_io.h:134
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:43
Definition: SimplicialComplexForAlpha.h:26
Rips complex data structure.
Definition: Rips_complex.h:57
Global distance functions.
This file includes common file reader for GUDHI.