/* 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): Vincent Rouvreau * * Copyright (C) 2016 Inria * * Modification(s): * - YYYY/MM Author: Description of the modification */ #ifndef INCLUDE_PERSISTENT_COHOMOLOGY_INTERFACE_H_ #define INCLUDE_PERSISTENT_COHOMOLOGY_INTERFACE_H_ #include #include #include // for std::pair #include // for sort namespace Gudhi { template class Persistent_cohomology_interface : public persistent_cohomology::Persistent_cohomology { private: /* * Compare two intervals by dimension, then by length. */ struct cmp_intervals_by_dim_then_length { explicit cmp_intervals_by_dim_then_length(FilteredComplex * sc) : sc_(sc) { } template bool operator()(const Persistent_interval & p1, const Persistent_interval & p2) { if (sc_->dimension(get < 0 > (p1)) == sc_->dimension(get < 0 > (p2))) return (sc_->filtration(get < 1 > (p1)) - sc_->filtration(get < 0 > (p1)) > sc_->filtration(get < 1 > (p2)) - sc_->filtration(get < 0 > (p2))); else return (sc_->dimension(get < 0 > (p1)) > sc_->dimension(get < 0 > (p2))); } FilteredComplex* sc_; }; public: Persistent_cohomology_interface(FilteredComplex* stptr) : persistent_cohomology::Persistent_cohomology(*stptr), stptr_(stptr) { } Persistent_cohomology_interface(FilteredComplex* stptr, bool persistence_dim_max) : persistent_cohomology::Persistent_cohomology(*stptr, persistence_dim_max), stptr_(stptr) { } std::vector>> get_persistence(int homology_coeff_field, double min_persistence) { persistent_cohomology::Persistent_cohomology::init_coefficients(homology_coeff_field); persistent_cohomology::Persistent_cohomology::compute_persistent_cohomology(min_persistence); // Custom sort and output persistence cmp_intervals_by_dim_then_length cmp(stptr_); auto persistent_pairs = persistent_cohomology::Persistent_cohomology::get_persistent_pairs(); std::sort(std::begin(persistent_pairs), std::end(persistent_pairs), cmp); std::vector>> persistence; for (auto pair : persistent_pairs) { persistence.push_back(std::make_pair(stptr_->dimension(get<0>(pair)), std::make_pair(stptr_->filtration(get<0>(pair)), stptr_->filtration(get<1>(pair))))); } return persistence; } std::vector, std::vector>> persistence_pairs() { auto pairs = persistent_cohomology::Persistent_cohomology::get_persistent_pairs(); std::vector, std::vector>> persistence_pairs; persistence_pairs.reserve(pairs.size()); for (auto pair : pairs) { std::vector birth; if (get<0>(pair) != stptr_->null_simplex()) { for (auto vertex : stptr_->simplex_vertex_range(get<0>(pair))) { birth.push_back(vertex); } } std::vector death; if (get<1>(pair) != stptr_->null_simplex()) { for (auto vertex : stptr_->simplex_vertex_range(get<1>(pair))) { death.push_back(vertex); } } persistence_pairs.push_back(std::make_pair(birth, death)); } return persistence_pairs; } private: // A copy FilteredComplex* stptr_; }; } // namespace Gudhi #endif // INCLUDE_PERSISTENT_COHOMOLOGY_INTERFACE_H_