mayya-sharipova commented on a change in pull request #267:
URL: https://github.com/apache/lucene/pull/267#discussion_r700577595
##########
File path: lucene/core/src/java/org/apache/lucene/util/hnsw/HnswGraph.java
##########
@@ -107,32 +113,82 @@ public static NeighborQueue search(
Random random)
throws IOException {
int size = graphValues.size();
+ int boundedNumSeed = Math.min(numSeed, 2 * size);
+ NeighborQueue results;
+
+ if (graphValues.maxLevel() == 0) {
+ // search in SNW; generate a number of entry points randomly
+ final int[] eps = new int[boundedNumSeed];
+ for (int i = 0; i < boundedNumSeed; i++) {
+ eps[i] = random.nextInt(size);
Review comment:
I think the resulted behaviour here is the same as in the current
implementation on the main branch. Even though we may get repeats here,
`searchLevel()` that follows, will discard these repeats with a condition `if
(visited.get(ep) == false) `
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
