searchLevel
Searches for the nearest neighbors of a query vector in a given level.
If the search stops early because it reaches the visited nodes limit, then the results will be marked incomplete through NeighborQueue.incomplete.
Return
a set of collected vectors holding the nearest neighbors found
Parameters
the scorer to compare the query with the nodes
the number of nearest to query results to return
level to search
the entry points for search at this level expressed as level 0th ordinals
the graph values
Add the closest neighbors found to a priority queue (heap). These are returned in REVERSE proximity order -- the most distant neighbor of the topK found, i.e. the one with the lowest score/comparison value, will be at the top of the heap, while the closest neighbor will be the last to be popped.