On Jun 23, 2008, at 4:18 AM, Marin wrote:
> > I was trying to do something yesterday evening and I found something > strange. After running this code: > q = Q() > for j in range(1): > a = A() > a.Q = q > a.C = WC() > > I get this graph edges (tuples): > import pprint > ppp = pprint.PrettyPrinter(indent=4) > ppp.pprint([(x.class_, y.class_) for x,y in tuples]) > [ (<class '__main__.Q'>, <class '__main__.A'>), > (<class '__main__.WC'>, <class '__main__.A'>), > (<class '__main__.Q'>, <class '__main__.A'>), > (<class '__main__.WC'>, <class '__main__.A'>)] > > It seems they are dubled. Maybe that's a part of the problem. that shouldn't be an issue, those tuples are all placed into a dictionary structure before topological.py sorts them. I'm pretty confident that topological.py is very strong except for the "tree" part. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sqlalchemy" group. To post to this group, send email to sqlalchemy@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sqlalchemy?hl=en -~----------~----~----~----~------~----~------~--~---
