CheckFiguerasRings.py :  » Development » Frowns » frowns » perception » Python Open Source

Home
Python Open Source
1.3.1.2 Python
2.Ajax
3.Aspect Oriented
4.Blog
5.Build
6.Business Application
7.Chart Report
8.Content Management Systems
9.Cryptographic
10.Database
11.Development
12.Editor
13.Email
14.ERP
15.Game 2D 3D
16.GIS
17.GUI
18.IDE
19.Installer
20.IRC
21.Issue Tracker
22.Language Interface
23.Log
24.Math
25.Media Sound Audio
26.Mobile
27.Network
28.Parser
29.PDF
30.Project Management
31.RSS
32.Search
33.Security
34.Template Engines
35.Test
36.UML
37.USB Serial
38.Web Frameworks
39.Web Server
40.Web Services
41.Web Unit
42.Wiki
43.Windows
44.XML
Python Open Source » Development » Frowns 
Frowns » frowns » perception » CheckFiguerasRings.py
# This code is hosed a bit... bummer
try:
    from kjbuckets import kjSet
except:
    import kjbuckets0 as kjbuckets
    
def checkRings(cycles):
    """This fixes a bug in figuras algorithm.  Sometimes when
    traversing through fused rings embedded in a larger ring
    two paths are returned when only one should have been
    This removes (most) of these cases"""
    # XXX I've encountered this bug before in figueras algorithm
    #     I really need to investigate if further and see
    #     if CDK has the same issues.
    res = []

    set = kjSet()
    sameSizes = {}
    i = 0
    for atoms, bonds in cycles:
        size = len(bonds)
        sameSizes[size] = sameSizes.get(size, []) + [(atoms, bonds)]

    keys = sameSizes.keys()
    keys.sort()
    last = kjSet()
    for size in keys:
        cycles = sameSizes[size]
        nextCycles = kjSet()

        i = 0
        if len(cycles) == 1:
            res.append(cycles[0])
            print "adding ring of size", cycles[0][1]
            continue

        dontAdd = {}
        for atoms1, bonds1 in cycles:
            s1 = kjSet(bonds1)
            j = i + 1
            for atom2, bonds2 in cycles[j:]:
                s2 = kjSet(bonds2)
                check = (s1-s2) + (s2-s1)
                l = len(check)

                if not (l and len(last & check) == l):
                    print "adding ring of size", len(bonds1)
                    res.append((atoms1, bonds1))
                else:
                    if i not in dontAdd:
                        dontAdd[j] = 1
                        res.append((atoms1, bonds1))
                        print "adding ring of size", len(bonds1)
                        print "dropping ring of size", len(bonds2)
        
            i += 1
        
                    
            nextCycles += s1
        last += nextCycles
    return res
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.