diff options
author | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-03-31 13:52:57 -0400 |
---|---|---|
committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-03-31 13:52:57 -0400 |
commit | 1258d1ed9e8064e08fd77d2dc3938fcebc130800 (patch) | |
tree | 506d5cbe32dd9efa1ae099e55d9124896ea94f7d /lib/sqlalchemy/topological.py | |
parent | 5c758932a512e281308d2e1c147e18ed4eddc6b0 (diff) | |
download | sqlalchemy-1258d1ed9e8064e08fd77d2dc3938fcebc130800.tar.gz |
- 'cycle' is a stack here - needs to be a list.
Diffstat (limited to 'lib/sqlalchemy/topological.py')
-rw-r--r-- | lib/sqlalchemy/topological.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/sqlalchemy/topological.py b/lib/sqlalchemy/topological.py index d35213f6b..9e584ff4e 100644 --- a/lib/sqlalchemy/topological.py +++ b/lib/sqlalchemy/topological.py @@ -270,7 +270,7 @@ def _find_cycles(edges): for (n, key) in edges.edges_by_parent(node): if key in cycle: continue - cycle.add(key) + cycle.append(key) if key is goal: cycset = set(cycle) for x in cycle: @@ -287,7 +287,7 @@ def _find_cycles(edges): cycle.pop() for parent in edges.get_parents(): - traverse(parent, set(), parent) + traverse(parent, [], parent) unique_cycles = set(tuple(s) for s in cycles.values()) |