From 12dde2f9e6acd6747dbd28027a115aedfe5c08c6 Mon Sep 17 00:00:00 2001 From: VarshiniShreeV Date: Sun, 27 Oct 2024 10:36:24 +0530 Subject: [PATCH] Fixed --- sorts/topological_sort.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/sorts/topological_sort.py b/sorts/topological_sort.py index 2cb003d76..542d1eec6 100644 --- a/sorts/topological_sort.py +++ b/sorts/topological_sort.py @@ -30,7 +30,7 @@ def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[st 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)