From: Matthew Fernandez <matthew.fernandez@gmail.com>
Date: Sun, 14 Feb 2021 05:24:09 +0000 (-0800)
Subject: #include nearest_neighbor_graph_ann.h to avoid duplicating a prototype
X-Git-Tag: 2.47.0~51^2~9
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=6f73d714a4078ceddd4bd14d23c0fa73ddeb3592;p=graphviz

#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 71e6488f2..efbad2bfe 100644
--- 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.