-
-
Notifications
You must be signed in to change notification settings - Fork 47.5k
Fixes bugs in graphs/dijkstra_algorithm.py #10092
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
Fixes bugs in graphs/dijkstra_algorithm.py #10092
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Reviewed the changes, please close the PR.
If I add doctests in the previous algorithm then it will fail, therefore I was first trying to fix the code and then add doctests to it. |
Make a separate PR that includes a doctest that proves the current code fails. Then it will be much easier to review this pull request. Do NOT add tests AND fixes in the SAME pull request. Tests in one PR and fixes in another PR. |
Describe your change:
There was a bug in PriorityQueue class due to which extract_min function was giving wrong output, hence fixed it.
Checklist: