Watch out, we've got a badass over here

Assignment operator definiton */

* Subdivide the list of points by a plane perpendicular on the axis * corresponding to the 'cutfeat' dimension at 'cutval' position.

Query for the \a num_closest closest points to a given point (entered as * query_point[0:dim-1]). Note that this is a short-cut method for

Query for the \a num_closest closest points to a given point * (entered as query_point[0:dim-1]). * Note that this is a short-cut method f

* Find all the neighbors to \a query_point[0:dim-1] within a maximum * radius. The output is given as a vector of pairs, of which the first

Remove a point from the set (Lazy Deletion) */

Method to safely remove a vertex and its associated edges

* Reserve space for complete graph. A complete undirected graph should have N*(N-1)/2 edges * @param num_vertices */

Stores the index in a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so * when loading the index

Stores the index in a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so * when loading the index

Stores the index in a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so * when loading the index