msokolov commented on PR #13566: URL: https://github.com/apache/lucene/pull/13566#issuecomment-2271669367
I plan to revisit this with a modified approach to address some gaps here: 1. Instead of computing the components rooted at node 0 and others, or trying to compute strongly-connected components, we should compute components rooted at the graph entry points (which are the nodes of the next higher level). In the end we want to ensure every node is reachable by searching: it should be enough to ensure that every node is reachable from at least one entry point. 2. While traversing the graph we can keep track of nodes that are not full and then when connecting isolated nodes, we can limit the search to those nodes. This should help ensure we always make connections when possible. -- 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
