2 Commits

Author	SHA1	Message	Date
Sébastien Loriot	51eac5d5ab	add comments	2010-02-25 13:49:04 +00:00
Sébastien Loriot	93b2b7cbac	Add bounded priority queue as an internal data-structure. ... Use the bounded_priority_queue inside Orthogonal_k_neighbor search and K_neighbor_search, a maximum of code is now shared by these two classes. This reduces computation time and memory needed. Extend the interface: to save time the sequence k-nearest neighbors can be sorted (default) or not. Add a new test that ensures all methods find the same kth closest neighbor. Update manual.	2010-01-29 15:19:39 +00:00