{{ message }}
Fixes bugs in graphs/dijkstra_algorithm.py - #10092
Merged
MaximSmolskiy merged 6 commits intoAug 27, 2025
Merged
MaximSmolskiy merged 6 commits into
MaximSmolskiy merged 6 commits into
Conversation
praful-katare
approved these changes
Oct 9, 2023
praful-katare
left a comment
There was a problem hiding this comment.
Reviewed the changes, please close the PR.
Member
Contributor
Author
|
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. |
Member
MaximSmolskiy
approved these changes
Aug 27, 2025
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.

Describe your change:
There was a bug in PriorityQueue class due to which extract_min function was giving wrong output, hence fixed it.
Checklist: