diff options
| author | Mike Bayer <mike_mp@zzzcomputing.com> | 2006-01-28 18:02:42 +0000 |
|---|---|---|
| committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2006-01-28 18:02:42 +0000 |
| commit | 8d1d7ec0316f3b325aa9cf30cdb714c768f65c74 (patch) | |
| tree | f42ba58f7ef4a4d75e4b196650e3aaac9460251e /test/dependency.py | |
| parent | f05b29eb096135a8399586e40f0d07152808c091 (diff) | |
| download | sqlalchemy-8d1d7ec0316f3b325aa9cf30cdb714c768f65c74.tar.gz | |
topological sort can detect cycles, and assemble them into a "big node" with all
the nodes in the cycle aggregated into one node
Diffstat (limited to 'test/dependency.py')
| -rw-r--r-- | test/dependency.py | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/test/dependency.py b/test/dependency.py index c2e5db164..90e5e7d73 100644 --- a/test/dependency.py +++ b/test/dependency.py @@ -123,13 +123,14 @@ class DependencySortTest(PersistTest): node4 = thingy('node4') node5 = thingy('node5') tuples = [ + (node4, node5), + (node5, node4), (node1, node2), (node2, node3), (node3, node1), - (node4, node5), - (node5, node4) + (node4, node1) ] - head = DependencySorter(tuples, []).sort() + head = DependencySorter(tuples, []).sort(allow_all_cycles=True) print "\n" + str(head) |