diff options
| -rw-r--r-- | src/Toplex_map/include/gudhi/Lazy_Toplex_map.h | 4 | ||||
| -rw-r--r-- | src/Toplex_map/include/gudhi/Toplex_map.h | 7 |
2 files changed, 10 insertions, 1 deletions
diff --git a/src/Toplex_map/include/gudhi/Lazy_Toplex_map.h b/src/Toplex_map/include/gudhi/Lazy_Toplex_map.h index 9aa163f9..434fea47 100644 --- a/src/Toplex_map/include/gudhi/Lazy_Toplex_map.h +++ b/src/Toplex_map/include/gudhi/Lazy_Toplex_map.h @@ -57,6 +57,10 @@ public: /** \brief Number of maximal simplices. */ std::size_t num_maximal_simplices() const; + /** \brief Number of vertices. */ + std::size_t num_vertices() const{ + return t0.size(); + } std::unordered_map<Vertex, std::size_t> gamma0_lbounds; private: diff --git a/src/Toplex_map/include/gudhi/Toplex_map.h b/src/Toplex_map/include/gudhi/Toplex_map.h index 4c6c4b02..565415e1 100644 --- a/src/Toplex_map/include/gudhi/Toplex_map.h +++ b/src/Toplex_map/include/gudhi/Toplex_map.h @@ -74,7 +74,12 @@ public: /** \brief Number of maximal simplices. */ std::size_t num_maximal_simplices() const; - std::set<Toplex_map::Vertex> unitary_collapse(const Toplex_map::Vertex k, const Toplex_map::Vertex d); + /** \brief Number of vertices. */ + std::size_t num_vertices() const{ + return t0.size(); + } + + std::set<Toplex_map::Vertex> unitary_collapse(const Toplex_map::Vertex k, const Toplex_map::Vertex d); protected: /** \internal Gives an index in order to look for a simplex quickly. */ |