You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@lucene.apache.org by GitBox <gi...@apache.org> on 2021/09/02 11:55:34 UTC

[GitHub] [lucene] msokolov commented on pull request #267: LUCENE-10054 Handle hierarchy in graph construction and search

msokolov commented on pull request #267:
URL: https://github.com/apache/lucene/pull/267#issuecomment-911588395


   > Extra work: need to do binary search to map node0 ids to the current level's node ids for search to start. Should not be that bad, as we use eps.length = 1 for levels > 0.
   
   Agreed, we don't need `nextLevelNode`, this extra work is going to be negligible


-- 
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: issues-unsubscribe@lucene.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org



---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org