diff options
author | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-04-06 01:42:58 -0400 |
---|---|---|
committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-04-06 01:42:58 -0400 |
commit | 04a814f97bd2793ef62f3becb93e840d09bf3ad8 (patch) | |
tree | a3bded882dc0d53194a8a9a668d5b0e8208f481c /lib/sqlalchemy/topological.py | |
parent | 9df8afc600cd69a87ece009beefa0108bb49b256 (diff) | |
download | sqlalchemy-04a814f97bd2793ef62f3becb93e840d09bf3ad8.tar.gz |
remove prints
Diffstat (limited to 'lib/sqlalchemy/topological.py')
-rw-r--r-- | lib/sqlalchemy/topological.py | 14 |
1 files changed, 1 insertions, 13 deletions
diff --git a/lib/sqlalchemy/topological.py b/lib/sqlalchemy/topological.py index 2ae631fb5..603bb055b 100644 --- a/lib/sqlalchemy/topological.py +++ b/lib/sqlalchemy/topological.py @@ -4,19 +4,7 @@ # This module is part of SQLAlchemy and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php -"""Topological sorting algorithms. - -The topological sort is an algorithm that receives this list of -dependencies as a *partial ordering*, that is a list of pairs which -might say, *X is dependent on Y*, *Q is dependent on Z*, but does not -necessarily tell you anything about Q being dependent on X. Therefore, -its not a straight sort where every element can be compared to -another... only some of the elements have any sorting preference, and -then only towards just some of the other elements. For a particular -partial ordering, there can be many possible sorts that satisfy the -conditions. - -""" +"""Topological sorting algorithms.""" from sqlalchemy.exc import CircularDependencyError from sqlalchemy import util |