x : array_like, last dimension self.m
An array of points to query.
k : integer
The number of nearest neighbors to return.
eps : nonnegative float
Return approximate nearest neighbors; the kth returned value
is guaranteed to be no further than (1+eps) times the
distance to the real kth nearest neighbor.
p : float, 1<=p<=infinity
Which Minkowski pnorm to use.
1 is the sumofabsolutevalues “Manhattan” distance
2 is the usual Euclidean distance
infinity is the maximumcoordinatedifference distance
distance_upper_bound : nonnegative float
Return only neighbors within this distance. This is used to prune
tree searches, so if you are doing a series of nearestneighbor
queries, it may help to supply the distance to the nearest neighbor
of the most recent point.
