pierwill commented on issue #13687: URL: https://github.com/apache/lucene/issues/13687#issuecomment-2312910112
> But it is still an open question the extent to which this kind of check could potentially improve graph connectivity and thus recall I only understand the broad ideas here. I'm pretty new to graph algorithms but would love to learn more. If you could outline this idea a bit more here, maybe we could work toward a test implementation? Is this something that we'd want to benchmark? -- 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
