/*    This file is part of the Gudhi Library. The Gudhi library
 *    (Geometric Understanding in Higher Dimensions) is a generic C++
 *    library for computational topology.
 *
 *    Author(s):       Mathieu Carrière
 *
 *    Copyright (C) 2017  INRIA Saclay (France)
 *
 *    This program is free software: you can redistribute it and/or modify
 *    it under the terms of the GNU General Public License as published by
 *    the Free Software Foundation, either version 3 of the License, or
 *    (at your option) any later version.
 *
 *    This program is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    GNU General Public License for more details.
 *
 *    You should have received a copy of the GNU General Public License
 *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#include <gudhi/GIC.h>

void usage(int nbArgs, char * const progName) {
  std::cerr << "Error: Number of arguments (" << nbArgs << ") is not correct\n";
  std::cerr << "Usage: " << progName << " filename.off N [--v] \n";
  std::cerr << "       i.e.: " << progName << " ../../../../data/points/human.off 100 --v \n";
  exit(-1);  // ----- >>
}

int main(int argc, char **argv) {
  if ((argc != 3) && (argc != 4)) usage(argc, (argv[0] - 1));

  using Point = std::vector<float>;

  std::string off_file_name(argv[1]);
  int m = atoi(argv[2]);
  bool verb = 0; if(argc == 4)  verb = 1;

  // ----------------------------------------------------------------------------
  // Init of a graph induced complex from an OFF file
  // ----------------------------------------------------------------------------

  Gudhi::graph_induced_complex::Graph_induced_complex<Point> GIC;
  GIC.set_verbose(verb); GIC.set_mask();

  bool check = GIC.read_point_cloud(off_file_name);

  if(!check)  std::cout << "Incorrect OFF file." << std::endl;
  else{

    GIC.set_color_from_coordinate();

    GIC.set_graph_from_OFF(off_file_name);

    GIC.set_cover_from_Voronoi(Gudhi::Euclidean_distance(),m);

    GIC.find_GIC_simplices();

    GIC.plot_OFF();

    Gudhi::graph_induced_complex::Simplex_tree stree; GIC.create_complex(stree);

    std::streambuf* streambufffer = std::cout.rdbuf();
    std::ostream output_stream(streambufffer);

    // ----------------------------------------------------------------------------
    // Display information about the graph induced complex
    // ----------------------------------------------------------------------------

    if(verb){
      output_stream << "Graph induced complex is of dimension " << stree.dimension() <<
                     " - " << stree.num_simplices() << " simplices - " <<
                     stree.num_vertices() << " vertices." << std::endl;

      output_stream << "Iterator on graph induced complex simplices" << std::endl;
      for (auto f_simplex : stree.filtration_simplex_range()) {
        for (auto vertex : stree.simplex_vertex_range(f_simplex)) {
          output_stream << vertex << " ";
        }
        output_stream << std::endl;
      }
    }
  }

  return 0;
}