We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 81661bd commit 09b41d6Copy full SHA for 09b41d6
sorts/topological_sort.py
@@ -9,7 +9,7 @@
9
vertices = ["a", "b", "c", "d", "e"]
10
11
12
-def topological_sort(start, visited, sort):
+def topological_sort(start: str, visited: list, sort: list):
13
"""Perform topological sort on a directed acyclic graph."""
14
current = start
15
# add current to visited
0 commit comments