code: public Answer computeNearestNeighbors(int k, double[] queryVector) throws Exception {
  		if (!loadIndexInMemory) {
  			throw new Exception("Cannot execute query because the index is not loaded in memory!");
  		}
  		long start = System.nanoTime();
  		BoundedPriorityQueue<Result> nnQueue = computeNearestNeighborsInternal(k, queryVector);
  		long indexSearchTime = System.nanoTime() - start;
  
  		return lookUp(nnQueue, indexSearchTime);
  
  	}
docs: This method returns an {@link Answer} object, which contains the k nearest neighbors along with their
  ids and distances from the query vector, ordered by lowest distance. The methods calls
  {@link #computeNearestNeighborsInternal(int, double[])} and then performs name lookup.
  
  @param k
  The number of nearest neighbors to return
  @param queryVector
  The query vector
  @return The answer
  @throws Exception