code: protected BoundedPriorityQueue<Result> computeNearestNeighborsInternal(int k, int iid) throws Exception {
  		double[] queryVector = getVector(iid); // get the vector with this internal id
  		return computeNearestNeighborsInternal(k, queryVector);
  	}
docs: Computes the k-nearest neighbors of the vector with the given internal id. The search is exhaustive but
  includes some optimizations that make it faster, especially for high dimensional vectors.
  
  @param k
  The number of nearest neighbors to be returned
  @param queryVector
  The internal id of the query vector
  
  @return A bounded priority queue of Result objects, which contains the k nearest neighbors along with
  their iids and distances from the vector with the given internal id, ordered by lowest
  distance.
  @throws Exception
  If the index is not loaded in memory