mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-06 05:45:53 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixed

Browse Source
This commit is contained in:
VarshiniShreeV 2024-10-27 10:36:24 +05:30
parent 3d3d5aad65
commit 12dde2f9e6
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sorts/topological_sort.py
View File

@ -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)