Fix shortestPathTo by correct selection of tentative node #10
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.
Dijkstra's algorithm requires that we visit nodes in order of least tentative distance. A bug in the code meant that the ordering was different, and some incorrect paths were reported.
Also, the algorithm takes a very long period of time to run on larger graphs, if we process already visited nodes (a node may now be in the priority queue many times). So these visited nodes should not be processed again.