Fixed

sorts/topological_sort.py

@@ -30,7 +30,7 @@
         if neighbor not in visited:
             sort = topological_sort(neighbor, visited, sort)
 
-    # After visiting all neigbors, add the current node to the sorted list
+    # After visiting all neighbors, add the current node to the sorted list
     sort.append(current)
 
     # If there are some nodes that were not visited (disconnected components)
@@ -47,5 +47,5 @@
     sort = topological_sort("a", [], [])
 
     # Reversing the list to get the correct topological order (Top down approach)
     sort.reverse()