We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
In https://github.com/kennyledet/Algorithm-Implementations/blob/master/Dijkstra%27s_Shortest_Path/Lua/Yonaba/dijkstra.lua lines 84 and 85 seems to be reversed.
if u == target then return backtrace(u) end if u.distance == math.huge then break end
As it is, you can detect a target arrival through a non-existing link.
The text was updated successfully, but these errors were encountered:
@Yonaba May you confirm this?
Sorry, something went wrong.
No branches or pull requests
In https://github.com/kennyledet/Algorithm-Implementations/blob/master/Dijkstra%27s_Shortest_Path/Lua/Yonaba/dijkstra.lua lines 84 and 85 seems to be reversed.
As it is, you can detect a target arrival through a non-existing link.
The text was updated successfully, but these errors were encountered: