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.

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

Closed
wants to merge 7 commits into from
Closed

Fixed: #12233 #12249

Changes from 1 commit
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
e08aadd
Issue 12192 fixed, Traversal direction is considered from top to bott…
Oct 20, 2024
239b8c8
Issue 12192 fixed with all checks passed
Oct 20, 2024
7ac458d
comment updated
Oct 20, 2024
c57f334
Merge branch 'TheAlgorithms:master' into master
vedprakash226 Oct 23, 2024
d400b63
kl_loss won't return -inf if y_true is 0 Issue Fixed
Oct 23, 2024
7a85256
Original code
vedprakash226 Oct 23, 2024
607a993
Code backup
vedprakash226 Oct 23, 2024
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
Next Next commit
comment updated
  • Loading branch information
Ved Prakash Vishwakarma authored and Ved Prakash Vishwakarma committed Oct 20, 2024
commit 7ac458d7462b48fd791f66e908842098f153dd02
2 changes: 1 addition & 1 deletion sorts/topological_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,11 +17,11 @@

def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[str]:
"""Perform topological sort on a directed acyclic graph."""
# consider edge direction from top to bottom
current = start
# add current to visited
visited.append(current)
neighbors = edges[current]
# direction not given so consider from top to bottom
# as the current node encounter add it to the topo sort list
sort.append(current)
for neighbor in neighbors:
Expand Down