sentences:  The methods are based on greedy traversing in proximity neighborhood graphs formula_2in which every point formula_3 is uniquely associated with vertex formula_4.The search for the nearest neighbors to a query "q" in the set "S" takes the form of searching for the vertex in the graph formula_2.The basic algorithm – greedy search – works as follows