[−][src]Module goko::query_tools
Tools and data structures for assisting cover tree queries.
Structs
KnnQueryHeap | The heaps for doing a fairly efficient KNN query. There are 3 heaps, the child min-heap, singleton min-heap, and distance max-heap.
The distance heap is for the output KNN, each node or point that's pushed onto the heap is pushed onto this distance heap.
If the heap grows past K it's popped off. This provides an estimate for the distance to the furthest nearest neighbor out of the |
MultiscaleQueryHeap | This is used to find the closest |
Traits
RoutingQueryHeap | If you have a algorithm that does local brute force KNN on just the children, implement this to use the node fn |
SingletonQueryHeap | If you have a algorithm that does local brute force KNN on just the singletons, implement this to use the node fn |