summaryrefslogtreecommitdiff
path: root/src/Toplex_map/benchmark/benchmark_tm.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/Toplex_map/benchmark/benchmark_tm.cpp')
-rw-r--r--src/Toplex_map/benchmark/benchmark_tm.cpp170
1 files changed, 89 insertions, 81 deletions
diff --git a/src/Toplex_map/benchmark/benchmark_tm.cpp b/src/Toplex_map/benchmark/benchmark_tm.cpp
index 5f13288c..eedb442b 100644
--- a/src/Toplex_map/benchmark/benchmark_tm.cpp
+++ b/src/Toplex_map/benchmark/benchmark_tm.cpp
@@ -1,3 +1,25 @@
+/* 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: François Godi, Vincent Rouvreau
+ *
+ * Copyright (C) 2018 INRIA
+ *
+ * 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 <iostream>
#include <random>
#include <chrono>
@@ -10,11 +32,10 @@ using namespace Gudhi;
typedef Toplex_map::Simplex Simplex;
typedef Toplex_map::Vertex Vertex;
-typedef std::pair< Simplex_tree<>::Simplex_handle, bool > typePairSimplexBool;
+typedef std::pair<Simplex_tree<>::Simplex_handle, bool> typePairSimplexBool;
class ST_wrapper {
-
-public:
+ public:
void insert_simplex(const Simplex& tau) {
/*std::cout << "insert_simplex - " << simplexTree.num_simplices() << " - ";
for (auto v : tau)
@@ -24,28 +45,22 @@ public:
simplexTree.insert_simplex_and_subfaces(tau);
}
- bool membership(const Simplex& tau) {
- return simplexTree.find(tau) != simplexTree.null_simplex();
- }
+ bool membership(const Simplex& tau) { return simplexTree.find(tau) != simplexTree.null_simplex(); }
Vertex contraction(const Vertex x, const Vertex y) {
// TODO (VR): edge contraction is not yet available for Simplex_tree
return y;
}
- std::size_t num_maximal_simplices() {
- return simplexTree.num_simplices();
- }
+ std::size_t num_maximal_simplices() { return simplexTree.num_simplices(); }
-private:
- Simplex_tree<> simplexTree;
- void erase_max(const Simplex& sigma) {
- if(membership(sigma))
- simplexTree.remove_maximal_simplex(simplexTree.find(sigma));
- }
+ private:
+ Simplex_tree<> simplexTree;
+ void erase_max(const Simplex& sigma) {
+ if (membership(sigma)) simplexTree.remove_maximal_simplex(simplexTree.find(sigma));
+ }
};
-
int n = 300;
int nb_insert_simplex1 = 3000;
@@ -54,76 +69,69 @@ int nb_contraction = 300;
int nb_insert_simplex2 = 3000;
int nb_membership2 = 400000;
-Simplex random_simplex(int n, std::size_t d){
- std::random_device rd;
- std::mt19937 gen(rd());
- std::uniform_int_distribution<std::size_t> dis(1, n);
- Simplex s;
- while(s.size() < d)
- s.insert(dis(gen));
- return s;
+Simplex random_simplex(int n, std::size_t d) {
+ std::random_device rd;
+ std::mt19937 gen(rd());
+ std::uniform_int_distribution<std::size_t> dis(1, n);
+ Simplex s;
+ while (s.size() < d) s.insert(dis(gen));
+ return s;
}
-std::vector<Simplex> r_vector_simplices(int n, int max_d, int m){
- std::random_device rd;
- std::mt19937 gen(rd());
- std::uniform_int_distribution<std::size_t> dis(1, max_d);
- std::vector<Simplex> v;
- for(int i=0; i<m; i++)
- v.push_back(random_simplex(n,dis(gen)));
- return v;
+std::vector<Simplex> r_vector_simplices(int n, int max_d, int m) {
+ std::random_device rd;
+ std::mt19937 gen(rd());
+ std::uniform_int_distribution<std::size_t> dis(1, max_d);
+ std::vector<Simplex> v;
+ for (int i = 0; i < m; i++) v.push_back(random_simplex(n, dis(gen)));
+ return v;
}
-template<typename complex_type>
-void chrono(int n, int d){
- complex_type K;
- std::vector<Simplex> simplices_insert_simplex1 = r_vector_simplices(n,d,nb_insert_simplex1);
- std::vector<Simplex> simplices_membership1 = r_vector_simplices(n,d,nb_membership1);
- std::vector<Simplex> simplices_insert_simplex2 = r_vector_simplices(n - 2*nb_contraction,d,nb_insert_simplex2);
- std::vector<Simplex> simplices_membership2 = r_vector_simplices(n - 2*nb_contraction,d,nb_membership2);
- std::chrono::time_point<std::chrono::system_clock> start, end;
-
- for(const Simplex& s : simplices_insert_simplex1)
- K.insert_simplex(s);
-
- for(const Simplex& s : simplices_membership1)
- K.membership(s);
-
- start = std::chrono::system_clock::now();
- for(int i = 1; i<=nb_contraction; i++)
- K.contraction(n-2*i,n-2*i-1);
- end = std::chrono::system_clock::now();
- auto c3 = std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
-
- start = std::chrono::system_clock::now();
- for(const Simplex& s : simplices_insert_simplex2)
- K.insert_simplex(s);
- end = std::chrono::system_clock::now();
- auto c1 = std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
-
- start = std::chrono::system_clock::now();
- for(const Simplex& s : simplices_membership2)
- K.membership(s);
- end = std::chrono::system_clock::now();
- auto c2 = std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
-
- if (c3 > 0)
- std::cout << c1 << "\t \t" << c2 << "\t \t" << c3 << "\t \t" << K.num_maximal_simplices() << std::endl;
- else
- std::cout << c1 << "\t \t" << c2 << "\t \tN/A\t \t" << K.num_maximal_simplices() << std::endl;
+template <typename complex_type>
+void chrono(int n, int d) {
+ complex_type K;
+ std::vector<Simplex> simplices_insert_simplex1 = r_vector_simplices(n, d, nb_insert_simplex1);
+ std::vector<Simplex> simplices_membership1 = r_vector_simplices(n, d, nb_membership1);
+ std::vector<Simplex> simplices_insert_simplex2 = r_vector_simplices(n - 2 * nb_contraction, d, nb_insert_simplex2);
+ std::vector<Simplex> simplices_membership2 = r_vector_simplices(n - 2 * nb_contraction, d, nb_membership2);
+ std::chrono::time_point<std::chrono::system_clock> start, end;
+
+ for (const Simplex& s : simplices_insert_simplex1) K.insert_simplex(s);
+
+ for (const Simplex& s : simplices_membership1) K.membership(s);
+
+ start = std::chrono::system_clock::now();
+ for (int i = 1; i <= nb_contraction; i++) K.contraction(n - 2 * i, n - 2 * i - 1);
+ end = std::chrono::system_clock::now();
+ auto c3 = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
+
+ start = std::chrono::system_clock::now();
+ for (const Simplex& s : simplices_insert_simplex2) K.insert_simplex(s);
+ end = std::chrono::system_clock::now();
+ auto c1 = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
+
+ start = std::chrono::system_clock::now();
+ for (const Simplex& s : simplices_membership2) K.membership(s);
+ end = std::chrono::system_clock::now();
+ auto c2 = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
+
+ if (c3 > 0)
+ std::cout << c1 << "\t \t" << c2 << "\t \t" << c3 << "\t \t" << K.num_maximal_simplices() << std::endl;
+ else
+ std::cout << c1 << "\t \t" << c2 << "\t \tN/A\t \t" << K.num_maximal_simplices() << std::endl;
}
-int main(){
- for(int d=5;d<=40;d+=5){
- std::cout << "d=" << d << " \t Insertions \t Membership \t Contractions \t Size" << std::endl;
- std::cout << "T Map \t \t";
- chrono<Toplex_map>(n,d);
- std::cout << "Lazy \t \t";
- chrono<Lazy_toplex_map>(n,d);
- if(d<=15){
- std::cout << "ST \t \t";
- chrono<ST_wrapper>(n,d);
- }
- std::cout << std::endl;
+int main() {
+ for (int d = 5; d <= 40; d += 5) {
+ std::cout << "d=" << d << " \t Insertions \t Membership \t Contractions \t Size" << std::endl;
+ std::cout << "T Map \t \t";
+ chrono<Toplex_map>(n, d);
+ std::cout << "Lazy \t \t";
+ chrono<Lazy_toplex_map>(n, d);
+ if (d <= 15) {
+ std::cout << "ST \t \t";
+ chrono<ST_wrapper>(n, d);
}
+ std::cout << std::endl;
+ }
}
generated by cgit v1.2.3 (git 2.39.1) at 2024-05-13 15:10:42 +0000