Modify the example to avoid misleading the user

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

Former-commit-id: fa4a318f59e6d6dea46694bd71d0a6a2baf1aaff

1 files changed, 4 insertions, 4 deletions

diff --git a/src/Spatial_searching/example/example_spatial_searching.cpp b/src/Spatial_searching/example/example_spatial_searching.cpp
index 54e3eb13..46aa48b3 100644
--- a/src/Spatial_searching/example/example_spatial_searching.cpp
+++ b/src/Spatial_searching/example/example_spatial_searching.cpp
@@ -32,8 +32,8 @@ int main (void)
   // Incremental nearest neighbor query
   std::cout << "Incremental nearest neighbors:\n";
   auto ins_range = points_ds.query_incremental_nearest_neighbors(points[45]);
-  // Get all the neighbors that are closer than 0.5
-  for (auto ins_iterator = ins_range.begin(); ins_iterator->second < 0.5*0.5 ; ++ins_iterator)
+  // Get the neighbors in distance order until we hit the first point
+  for (auto ins_iterator = ins_range.begin(); ins_iterator->first != 0 ; ++ins_iterator)
     std::cout << ins_iterator->first << " (sq. dist. = " << ins_iterator->second << ")\n";
 
   // 10-farthest neighbor query
@@ -45,8 +45,8 @@ int main (void)
   // Incremental farthest neighbor query
   std::cout << "Incremental farthest neighbors:\n";
   auto ifs_range = points_ds.query_incremental_farthest_neighbors(points[45]);
-  // Get all the neighbors that are farthest than 2.3
-  for (auto ifs_iterator = ifs_range.begin(); ifs_iterator->second > 2.3*2.3 ; ++ifs_iterator)
+  // Get the neighbors in distance reverse order until we hit the first point
+  for (auto ifs_iterator = ifs_range.begin(); ifs_iterator->first != 0 ; ++ifs_iterator)
     std::cout << ifs_iterator->first << " (sq. dist. = " << ifs_iterator->second << ")\n";
   
   return 0;