Rarely used shortest path algorithm simpler and more powerful than Dijkstra's (bugfix-66.com) 1 points by bugfix-66 3y ago ↗ HN
[–] bugfix-66 3y ago ↗ Wikipedia:https://en.m.wikipedia.org/wiki/Shortest_Path_Faster_Algorit...Spoiler:To fix the bug, change dist[to] = dist2 to dist[to] = dist3
1 comment
[ 3.2 ms ] story [ 14.4 ms ] threadhttps://en.m.wikipedia.org/wiki/Shortest_Path_Faster_Algorit...
Spoiler:
To fix the bug, change
to