Fix contiguous_vertices(). Use it in boundary iterator.

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

Former-commit-id: 5b4475f39fe6adf2190223a753625057260e8805

1 files changed, 3 insertions, 2 deletions

diff --git a/src/Simplex_tree/include/gudhi/Simplex_tree.h b/src/Simplex_tree/include/gudhi/Simplex_tree.h
index d19071fb..30faebc8 100644
--- a/src/Simplex_tree/include/gudhi/Simplex_tree.h
+++ b/src/Simplex_tree/include/gudhi/Simplex_tree.h
@@ -573,11 +573,12 @@ class Simplex_tree {
     }
   }
 
+ public:
   /** \private \brief Test if the vertices have contiguous numbering: 0, 1, etc.  */
   bool contiguous_vertices() const {
     if(root_.members_.empty()) return true;
-    if(root_.members_.front()!=0) return false;
-    if(root_.members_.back()!=root_.members_.size()-1) return false;
+    if(root_.members_.begin()->first!=0) return false;
+    if(std::prev(root_.members_.end())->first!=root_.members_.size()-1) return false;
     return true;
   }