#include nearest_neighbor_graph_ann.h to avoid duplicating a prototype

diff --git a/lib/mingle/nearest_neighbor_graph_ann.cpp b/lib/mingle/nearest_neighbor_graph_ann.cpp
index 71e6488f2a33587d3534648846a10534dbb8ee9c..efbad2bfed752f897febba01458fa5264b702b3d 100644 (file)
--- a/lib/mingle/nearest_neighbor_graph_ann.cpp
+++ b/lib/mingle/nearest_neighbor_graph_ann.cpp
@@ -16,6 +16,7 @@
 //----------------------------------------------------------------------
 
 #include <ANN/ANN.h>                                   // ANN declarations
+#include <mingle/nearest_neighbor_graph_ann.h>
 #include <vector>
 
 int                             dim                             = 4;                    // dimension
@@ -68,9 +69,6 @@ static void sortPtsY(int n, ANNpointArray pts){
   }
 }
 
-
-extern "C" void nearest_neighbor_graph_ann(int nPts, int dim, int k, double eps, double *x, int *nz0, int **irn0, int **jcn0, double **val0);
-
 void nearest_neighbor_graph_ann(int nPts, int dim, int k, double eps, double *x, int *nz0, int **irn0, int **jcn0, double **val0){
 
   /* Gives a nearest neighbor graph is a list of dim-dimendional points. The connectivity is in irn/jcn, and the distance in val.