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

Fixed

Browse Source
This commit is contained in:
VarshiniShreeV 2024-10-27 10:14:27 +05:30
parent 6a6876fc10
commit d0e0ea1d47
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

@ -16,7 +16,7 @@ edges: dict[str, list[str]] = {
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