From e08aadd00eff6b419fd738d7838912740c0223ab Mon Sep 17 00:00:00 2001 From: Ved Prakash Vishwakarma Date: Sun, 20 Oct 2024 13:11:19 +0530 Subject: [PATCH] Issue 12192 fixed, Traversal direction is considered from top to bottom as stated. --- sorts/topological_sort.py | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/sorts/topological_sort.py b/sorts/topological_sort.py index efce8165fcac..c790cc93d54b 100644 --- a/sorts/topological_sort.py +++ b/sorts/topological_sort.py @@ -21,12 +21,13 @@ 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 + sort.append(current) for neighbor in neighbors: # if neighbor not in visited, visit if neighbor not in visited: sort = topological_sort(neighbor, visited, sort) - # if all neighbors visited add current to sort - sort.append(current) # if all vertices haven't been visited select a new one to visit if len(visited) != len(vertices): for vertice in vertices: