[Cdk-devel] [ cdk-Bugs-640750 ] Inefficient ring search?

[SourceForge.net <no...@so...>]

Bugs item #640750, was opened at 2002-11-19 16:46
Message generated for change (Settings changed) made by steinbeck
You can respond by visiting: 
https://sourceforge.net/tracker/?func=detail&atid=120024&aid=640750&group_id=20024

Category: org.openscience.cdk.ringsearch
Group: None
>Status: Closed
>Resolution: Wont Fix
Priority: 5
Submitted By: Christoph Steinbeck (steinbeck)
Assigned to: Christoph Steinbeck (steinbeck)
Summary: Inefficient ring search?

Initial Comment:
Luo Cao wrote:
As to the algorithm SSSR(function findSSSR() in the
SSSRFinder.java), I think it can be more efficent. In
the function,As one ring is fould, then break the bonds
. After that, I think you should compute the minimum
number of rings again. If ring exists,then continue; if
not,break.


----------------------------------------------------------------------

You can respond by visiting: 
https://sourceforge.net/tracker/?func=detail&atid=120024&aid=640750&group_id=20024