Skip to content

Fixed: #12233 #12249

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
Closed
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Code backup
  • Loading branch information
vedprakash226 authored Oct 23, 2024
commit 607a993ab23645b674cfd8ffece82c56daa741d9
1 change: 0 additions & 1 deletion sorts/topological_sort.py
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,6 @@
vertices: list[str] = ["a", "b", "c", "d", "e"]



def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[str]:
"""Perform topological sort on a directed acyclic graph."""
current = start
Expand Down
Loading