1 files changed, 0 insertions, 37 deletions
diff --git a/src/Simplex_tree/include/gudhi/Simplex_tree.h b/src/Simplex_tree/include/gudhi/Simplex_tree.h
index 0a406076..096270ee 100644
--- a/src/Simplex_tree/include/gudhi/Simplex_tree.h
+++ b/src/Simplex_tree/include/gudhi/Simplex_tree.h
@@ -1104,43 +1104,6 @@ class Simplex_tree {
       os << filtration(sh) << " \n";
     }
   }
-/***************************************************************************************************************/  
- public:
-  /** \brief Prints the simplex_tree hierarchically. 
-   * Since it prints the vertices recursively, one can watch its tree shape.
-   */
-  void debug_tree() {
-    std::cout << "{" << &root_ << "} -------------------------------------------------------------------" << std::endl;    
-    for (auto sh = root_.members().begin(); sh != root_.members().end(); ++sh) {
-      std::cout << sh->first << " [" << sh->second.filtration() << "] ";
-      if (has_children(sh)) {
-        rec_debug_tree(sh->second.children());
-      } else {
-        std::cout << " {- " << sh->second.children() << "} ";
-      }
-      std::cout << std::endl;
-    }
-    std::cout << "--------------------------------------------------------------------------------------" << std::endl;    
-  }
-
-
-  /** \brief Recursively prints the simplex_tree, using depth first search. */
- private:
-  void rec_debug_tree(Siblings * sib) {
-    std::cout << " {" << sib << "} (";
-    for (auto sh = sib->members().begin(); sh != sib->members().end(); ++sh) {
-      std::cout << " " << sh->first << " [" << sh->second.filtration() << "] ";
-      if (has_children(sh)) {
-        rec_debug_tree(sh->second.children());
-      } else {
-        std::cout << " {- " << sh->second.children() << "} ";
-      }
-    }
-    std::cout << ")";
-  }
-
-/*****************************************************************************************************************/
-
 
  private:
   Vertex_handle null_vertex_;