|
123456789101112131415161718192021222324252627282930313233343536373839404142434445 |
- /*!
- * \file main.cpp
- * \brief Main application file
- *
- * \author
- * Christos Choutouridis AEM:8997
- * <cchoutou@ece.auth.gr>
- */
- #include <iostream>
-
- // Definition of the kNN result struct
- typedef struct knnresult{
- int * nidx; //!< Indices (0-based) of nearest neighbors [m-by-k]
- double * ndist; //!< Distance of nearest neighbors [m-by-k]
- int m; //!< Number of query points [scalar]
- int k; //!< Number of nearest neighbors [scalar]
- } knnresult;
-
- //! Compute k nearest neighbors of each point in X [n-by-d]
- /*!
-
- \param X Corpus data points [n-by-d]
- \param Y Query data points [m-by-d]
- \param n Number of corpus points [scalar]
- \param m Number of query points [scalar]
- \param d Number of dimensions [scalar]
- \param k Number of neighbors [scalar]
-
- \return The kNN result
- */
- knnresult kNN(double * X, double * Y, int n, int m, int d, int k) {
-
-
-
- }
-
- int main () {
-
- std::cout << "Lets start!\n";
-
- return 0;
- }
-
-
-
|