mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-23 09:38:27 +00:00
Code Issues Packages Projects Releases Wiki Activity

Issue 12192 fixed, Traversal direction is considered from top to bottom as stated.

Browse Source
This commit is contained in:
Ved Prakash Vishwakarma 2024-10-20 13:11:19 +05:30
parent 03a42510b0
commit e08aadd00e
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
sorts/topological_sort.py
View File

@ -21,12 +21,13 @@ def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[st
# add current to visited # add current to visited
visited.append(current) visited.append(current)
neighbors = edges[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: for neighbor in neighbors:
# if neighbor not in visited, visit # if neighbor not in visited, visit
if neighbor not in visited: if neighbor not in visited:
sort = topological_sort(neighbor, visited, sort) 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 all vertices haven't been visited select a new one to visit
if len(visited) != len(vertices): if len(visited) != len(vertices):
for vertice in vertices: for vertice in vertices: