Fix euclidean distance for rips

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

Former-commit-id: a07dfd4ffe3f17bf242ffb5b57058e99171a8016

1 files changed, 4 insertions, 4 deletions

diff --git a/src/common/include/gudhi/distance_functions.h b/src/common/include/gudhi/distance_functions.h
index b2726ba8..006df275 100644
--- a/src/common/include/gudhi/distance_functions.h
+++ b/src/common/include/gudhi/distance_functions.h
@@ -28,13 +28,13 @@
 /* Compute the Euclidean distance between two Points given
  * by a range of coordinates. The points are assumed to have 
  * the same dimension. */
-template< typename Point >
-double euclidean_distance(const Point &p1,const Point &p2) {
-  double dist = 0.;
+template< typename Filtration_value, typename Point >
+Filtration_value euclidean_distance(const Point &p1,const Point &p2) {
+  Filtration_value dist = 0.;
   auto it1 = p1.begin();
   auto it2 = p2.begin();
   for (; it1 != p1.end(); ++it1, ++it2) {
-    double tmp = *it1 - *it2;
+    Filtration_value tmp = (double)(*it1) - (double)(*it2);
     dist += tmp*tmp;
   }
   return std::sqrt(dist);