comment improved

Author: Ved Prakash Vishwakarma

Diff for: 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: