summaryrefslogtreecommitdiff
path: root/lib/sqlalchemy/util/topological.py
diff options
context:
space:
mode:
Diffstat (limited to 'lib/sqlalchemy/util/topological.py')
-rw-r--r--lib/sqlalchemy/util/topological.py4
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/sqlalchemy/util/topological.py b/lib/sqlalchemy/util/topological.py
index 8390c5554..ae4b37426 100644
--- a/lib/sqlalchemy/util/topological.py
+++ b/lib/sqlalchemy/util/topological.py
@@ -3,7 +3,7 @@
# <see AUTHORS file>
#
# This module is part of SQLAlchemy and is released under
-# the MIT License: http://www.opensource.org/licenses/mit-license.php
+# the MIT License: https://www.opensource.org/licenses/mit-license.php
"""Topological sorting algorithms."""
@@ -58,7 +58,7 @@ def sort(tuples, allitems, deterministic_order=True):
def find_cycles(tuples, allitems):
# adapted from:
- # http://neopythonic.blogspot.com/2009/01/detecting-cycles-in-directed-graph.html
+ # https://neopythonic.blogspot.com/2009/01/detecting-cycles-in-directed-graph.html
edges = util.defaultdict(set)
for parent, child in tuples: