11#ifndef INCLUDE_WITNESS_COMPLEX_INTERFACE_H_
12#define INCLUDE_WITNESS_COMPLEX_INTERFACE_H_
14#include <gudhi/Simplex_tree.h>
15#include <gudhi/Witness_complex.h>
17#include "Simplex_tree_interface.h"
26namespace witness_complex {
28class Witness_complex_interface {
29 using Nearest_landmark_range = std::vector<std::pair<std::size_t, double>>;
30 using Nearest_landmark_table = std::vector<Nearest_landmark_range>;
33 Witness_complex_interface(
const Nearest_landmark_table& nlt) {
37 ~Witness_complex_interface() {
38 delete witness_complex_;
41 void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
double max_alpha_square,
42 std::size_t limit_dimension) {
43 witness_complex_->create_complex(*simplex_tree, max_alpha_square, limit_dimension);
46 void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
47 double max_alpha_square) {
48 witness_complex_->create_complex(*simplex_tree, max_alpha_square);
Constructs strong witness complex for given sets of witnesses and landmarks in Euclidean space.
Definition: Euclidean_strong_witness_complex.h:51