2 files changed, 10 insertions, 17 deletions
diff --git a/src/Simplex_tree/include/gudhi/Simplex_tree.h b/src/Simplex_tree/include/gudhi/Simplex_tree.h
index 4c6a95e8..35d839e2 100644
--- a/src/Simplex_tree/include/gudhi/Simplex_tree.h
+++ b/src/Simplex_tree/include/gudhi/Simplex_tree.h
@@ -41,7 +41,6 @@
 #include <functional>  // for greater<>
 
 namespace Gudhi {
-
 /** \defgroup simplex_tree Filtered Complexes
  *
  * A simplicial complex \f$\mathbf{K}\f$
@@ -449,6 +448,15 @@ class Simplex_tree {
     }
   }
 
+  /** \brief Sets the filtration value of a simplex.
+   *
+   * No action if called on the null_simplex*/
+  void assign_filtration(Simplex_handle sh, Filtration_value fv) {
+    if (sh != null_simplex()) {
+      sh->second.assign_filtration(fv);
+    }
+  }
+
   /** \brief Returns an upper bound of the filtration values of the simplices. */
   Filtration_value filtration() const {
     return threshold_;
@@ -730,7 +738,6 @@ class Simplex_tree {
     sh->second.assign_key(key);
   }
 
- public:
   /** Returns the two Simplex_handle corresponding to the endpoints of
    * and edge. sh must point to a 1-dimensional simplex. This is an
    * optimized version of the boundary computation. */
@@ -1091,7 +1098,7 @@ class Simplex_tree {
       os << filtration(sh) << " \n";
     }
   }
-
+  
  private:
   Vertex_handle null_vertex_;
   /** \brief Upper bound on the filtration values of the simplices.*/
@@ -1106,7 +1113,6 @@ class Simplex_tree {
 };
 
 // Print a Simplex_tree in os.
-
 template<typename...T>
 std::ostream& operator<<(std::ostream & os, Simplex_tree<T...> & st) {
   for (auto sh : st.filtration_simplex_range()) {
diff --git a/src/Simplex_tree/test/simplex_tree_unit_test.cpp b/src/Simplex_tree/test/simplex_tree_unit_test.cpp
index fff00d77..00cf69bc 100644
--- a/src/Simplex_tree/test/simplex_tree_unit_test.cpp
+++ b/src/Simplex_tree/test/simplex_tree_unit_test.cpp
@@ -492,19 +492,6 @@ BOOST_AUTO_TEST_CASE(NSimplexAndSubfaces_tree_insertion) {
   /*   A facet [3,4,5]        */
   /*   A cell  [0,1,6,7]      */
 
-  typeSimplex simplexPair1 = std::make_pair(SimplexVector1, DEFAULT_FILTRATION_VALUE);
-  typeSimplex simplexPair2 = std::make_pair(SimplexVector2, DEFAULT_FILTRATION_VALUE);
-  typeSimplex simplexPair3 = std::make_pair(SimplexVector3, DEFAULT_FILTRATION_VALUE);
-  typeSimplex simplexPair4 = std::make_pair(SimplexVector4, DEFAULT_FILTRATION_VALUE);
-  typeSimplex simplexPair5 = std::make_pair(SimplexVector5, DEFAULT_FILTRATION_VALUE);
-  typeSimplex simplexPair6 = std::make_pair(SimplexVector6, DEFAULT_FILTRATION_VALUE);
-  test_simplex_tree_contains(st, simplexPair1, 6); // (2,1,0) is in position 6
-  test_simplex_tree_contains(st, simplexPair2, 7); // (3) is in position 7
-  test_simplex_tree_contains(st, simplexPair3, 8); // (3,0) is in position 8
-  test_simplex_tree_contains(st, simplexPair4, 2); // (1,0) is in position 2
-  test_simplex_tree_contains(st, simplexPair5, 14); // (3,4,5) is in position 14
-  test_simplex_tree_contains(st, simplexPair6, 26); // (7,6,1,0) is in position 26
-
   // ------------------------------------------------------------------------------------------------------------------
   // Find in the simplex_tree
   // ------------------------------------------------------------------------------------------------------------------