[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

sorts/topological_sort.py

@@ -21,8 +21,8 @@ def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[st
     # add current to visited
     visited.append(current)
     neighbors = edges[current]
-    #traversal from top to down in tree like graph (direction not given) we consider direction from top to down
-    #current node encounter add it to the topo sort list
+    # traversal from top to down in tree like graph (direction not given) we consider direction from top to down
+    # current node encounter add it to the topo sort list
     sort.append(current)
 
     for neighbor in neighbors: