slow-J commented on issue #13687: URL: https://github.com/apache/lucene/issues/13687#issuecomment-4671140320
Hi Mike @msokolov , I was taking a look here and your reading some of your comments on https://github.com/apache/lucene/pull/13566, and that your approach was to ensure every node is reachable from the entry point. You also did mention about SCC that "`"my implementation is super slow`" during indexing. I was curious is there still a use case for an SCC approach here? Could it be used as a debugging/diagnostic tool (this would ignore the penalty during indexing)? We can add an `graphIsStronglyConnected` method here mirroring the setup of the existing `graphIsRooted`, but I haven't really found a consumer for it. -- 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]
