Closed daviddoria closed 12 years ago
The min_dist_linear_search linear search indeed is templated like this, but the DVP tree does not seem to be.
Switched to interface to take an output-iterator instead, similar to STL algorithms like std::copy. This strategy seems a lot better after all.
Current the find_nearest_impl function stores the result of the search (the k nearest neighbors) in a std::multimap<distance_type, Key> . It would be nice to be able to instead store them in a vector, for example.