text: /*    This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
   *    See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
   *    Author(s):       Vincent Rouvreau
   *
   *    Copyright (C) 2016 Inria
   *
   *    Modification(s):
   *      - YYYY/MM Author: Description of the modification
   */
  
  #ifndef INCLUDE_STRONG_WITNESS_COMPLEX_INTERFACE_H_
  #define INCLUDE_STRONG_WITNESS_COMPLEX_INTERFACE_H_
  
  #include <gudhi/Simplex_tree.h>
  #include <gudhi/Strong_witness_complex.h>
  
  #include "Simplex_tree_interface.h"
  
  #include <vector>
  #include <utility>  // std::pair
  #include <iostream>
  #include <cstddef>
  
  namespace Gudhi {
  
  namespace witness_complex {
  
  class Strong_witness_complex_interface {
    using Nearest_landmark_range = std::vector<std::pair<std::size_t, double>>;
    using Nearest_landmark_table = std::vector<Nearest_landmark_range>;
  
   public:
    Strong_witness_complex_interface(const Nearest_landmark_table& nlt) {
      witness_complex_ = new Strong_witness_complex<Nearest_landmark_table>(nlt);
    }
  
    ~Strong_witness_complex_interface() {
      delete witness_complex_;
    }
  
    void create_simplex_tree(Simplex_tree_interface<>* simplex_tree, double  max_alpha_square,
                             std::size_t limit_dimension) {
      witness_complex_->create_complex(*simplex_tree, max_alpha_square, limit_dimension);
      simplex_tree->initialize_filtration();
    }
  
    void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
                             double  max_alpha_square) {
      witness_complex_->create_complex(*simplex_tree, max_alpha_square);
      simplex_tree->initialize_filtration();
    }
  
   private:
    Strong_witness_complex<Nearest_landmark_table>* witness_complex_;
  };
  
  }  // namespace witness_complex
  
  }  // namespace Gudhi
  
  #endif  // INCLUDE_STRONG_WITNESS_COMPLEX_INTERFACE_H_
  