hallo. AFAI understand from the source, in the graph used for topology sorting in session.flush(), the nodes are representing the objects' mappers. (and not the tables as in metadata.create_all() ).
Also, mappers which inherit from others, are replaced by their bases/roots. Edges in the graph are the relations between the mappers, and post_update=True is considered as cut (i.e. is not an edge). And then, the graph of relations is checked for cycles. So if i want to run an automatical mincut algo, it should be over a graph, having root mappers as nodes and all relations as edges. i am right? ciao svil btw, in topological.py: QueueDependencySorter.sort(), the _find_cycles() call is duplicated. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
