msokolov commented on issue #13687: URL: https://github.com/apache/lucene/issues/13687#issuecomment-2310826957
Thanks for opening this! Since writing that comment I implemented a different connection criterion which guarantees that every node is reachable from the entry point node in the hierarchical graph. I think this more closely corresponds to our search-time behavior than a strongly-connected test would? But it is still an open question the extent to which this kind of check could potentially improve graph connectivity and thus recall -- 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-unsubscr...@lucene.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
