comment improved

TheAlgorithms · Oct 20, 2024 · 2efd1f4 · 2efd1f4
1 parent e08aadd
commit 2efd1f4
Showing 1 changed file with 3 additions and 2 deletions.
diff --git a/sorts/topological_sort.py b/sorts/topological_sort.py
@@ -21,9 +21,10 @@ def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[st
     # add current to visited
     visited.append(current)
     neighbors = edges[current]
-    #as we are traversing in from top to down in tree like graph (direction not given) we consider direction from top to down
-    #as the 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:
         # if neighbor not in visited, visit
         if neighbor not in visited: