The problem: Planet coords are sorted, how can we reach O(1/k*log(n)) for time Ordo in Dijkstra? The information leaked from Chinese hackers. We got the picture how they do ^^^ :) Source: A team from [...] Read more
Story: Chinese hackers are enhancing Dijkstra algorithm getting 1/k*log(n) time Ordo :)