Fixed

sorts/topological_sort.py

@@ -16,7 +16,7 @@
 
 vertices: list[str] = ["a", "b", "c", "d", "e"]
 
-"""Perform topological sort on a directed acyclic graph(DAG) starting from the specified node"""
+# Perform topological sort on a DAG starting from the specified node
 def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[str]:
     current = start
     # Mark the current node as visited
@@ -47,5 +47,5 @@
     sort = topological_sort("a", [], [])
 
     # Reversing the list to get the correct topological order (Top down approach)
     sort.reverse()