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

Jump to bottom

Problem regarding Dijkstra's algorithm with changed values #166

Open
sleipnir029 opened this issue May 20, 2020 · 0 comments
Open

Problem regarding Dijkstra's algorithm with changed values #166

sleipnir029 opened this issue May 20, 2020 · 0 comments

Comments

@sleipnir029
Copy link

sleipnir029 commented May 20, 2020 •
edited
Loading

For the given graph, when I changed the values of A and B, where A < B. I don't get the desired path.
Here's the link to the code. I have checked for negative-weight edges and found none. I have also implemented a function that shows the final path.

Result for the given graph:
firstprint

Result with changed values
secondprint
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@sleipnir029