> I think it was the thread where I mentioned I'm working on > kekulization algorithm using graph theory (maximum matching). It > has been quite some time when I last looked at that code and it > is not yet usable.
A maximal matching algorithm would be really great, since it would greatly improve performance. I think there are many people who might be willing to help test or contribute if you're willing to put it up on a GitHub branch or something similar. Thanks very much, -Geoff ------------------------------------------------------------------------------ Own the Future-Intel® Level Up Game Demo Contest 2013 Rise to greatness in Intel's independent game demo contest. Compete for recognition, cash, and the chance to get your game on Steam. $5K grand prize plus 10 genre and skill prizes. Submit your demo by 6/6/13. http://p.sf.net/sfu/intel_levelupd2d _______________________________________________ OpenBabel-Devel mailing list OpenBabel-Devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/openbabel-devel
