From 8447fa7575ae4db0db6daa8e03a0c2f9a374df7c Mon Sep 17 00:00:00 2001
From: glisse <glisse@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Thu, 29 Mar 2018 15:19:20 +0000
Subject: Use add_edge_without_blockers in GudhUI.

When the meaning of add_edge changed, GudhUI was not updated. The old functionality is available as add_edge_without_blockers.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@3318 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 58b10f79177736cc99e35fb526e4c987d615ae4c
---
 src/GudhUI/model/Model.h             | 2 +-
 src/GudhUI/utils/Critical_points.h   | 2 +-
 src/GudhUI/utils/K_nearest_builder.h | 2 +-
 src/GudhUI/utils/Rips_builder.h      | 2 +-
 4 files changed, 4 insertions(+), 4 deletions(-)

(limited to 'src/GudhUI')

diff --git a/src/GudhUI/model/Model.h b/src/GudhUI/model/Model.h
index fc284cc6..072d1185 100644
--- a/src/GudhUI/model/Model.h
+++ b/src/GudhUI/model/Model.h
@@ -74,7 +74,7 @@ class CGAL_geometric_flag_complex_wrapper {
       // std::cout << "size:" << vertices.size() << std::endl;
       for (std::size_t i = 0; i < vertices.size(); ++i)
         for (std::size_t j = i + 1; j < vertices.size(); ++j)
-          complex_.add_edge(Vertex_handle(vertices[i]), Vertex_handle(vertices[j]));
+          complex_.add_edge_without_blockers(Vertex_handle(vertices[i]), Vertex_handle(vertices[j]));
     }
   }
 
diff --git a/src/GudhUI/utils/Critical_points.h b/src/GudhUI/utils/Critical_points.h
index 2a18e079..e7b9ef31 100644
--- a/src/GudhUI/utils/Critical_points.h
+++ b/src/GudhUI/utils/Critical_points.h
@@ -79,7 +79,7 @@ template<typename SkBlComplex> class Critical_points {
     unsigned pos = 0;
     for (Edge e : edges) {
       std::cout << "edge " << pos++ << "/" << edges.size() << "\n";
-      auto eh = filled_complex_.add_edge(e.first, e.second);
+      auto eh = filled_complex_.add_edge_without_blockers(e.first, e.second);
       int is_contractible(is_link_reducible(eh));
 
       switch (is_contractible) {
diff --git a/src/GudhUI/utils/K_nearest_builder.h b/src/GudhUI/utils/K_nearest_builder.h
index 7be0a4f4..4000a331 100644
--- a/src/GudhUI/utils/K_nearest_builder.h
+++ b/src/GudhUI/utils/K_nearest_builder.h
@@ -81,7 +81,7 @@ template<typename SkBlComplex> class K_nearest_builder {
       for (auto it = ++search.begin(); it != search.end(); ++it) {
         Vertex_handle q(std::get<1>(it->first));
         if (p != q && complex_.contains_vertex(p) && complex_.contains_vertex(q))
-          complex_.add_edge(p, q);
+          complex_.add_edge_without_blockers(p, q);
       }
     }
   }
diff --git a/src/GudhUI/utils/Rips_builder.h b/src/GudhUI/utils/Rips_builder.h
index b22f4db6..59b4bee2 100644
--- a/src/GudhUI/utils/Rips_builder.h
+++ b/src/GudhUI/utils/Rips_builder.h
@@ -60,7 +60,7 @@ template<typename SkBlComplex> class Rips_builder {
       std::cout.flush();
       for (auto q = p; ++q != vertices.end(); /**/)
         if (squared_eucl_distance(complex_.point(*p), complex_.point(*q)) < 4 * alpha * alpha)
-          complex_.add_edge(*p, *q);
+          complex_.add_edge_without_blockers(*p, *q);
     }
     std::cout << std::endl;
   }
-- 
cgit v1.2.3