Skip to content
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.

Sign up for GitHub

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

Fix: #12192 #12202

Closed
wants to merge 1 commit into from
Closed

Fix: #12192 #12202

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
5 changes: 3 additions & 2 deletions sorts/topological_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,12 +21,13 @@
# 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

Check failure on line 24 in sorts/topological_sort.py

View workflow job for this annotation

GitHub Actions / ruff

Ruff (E501) 

sorts/topological_sort.py:24:89: E501 Line too long (125 > 88)
#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:
Expand Down
Loading