891 followers
@__femb0t @tthbaltazar I read a cool paper once that reinvented Dijkstra's algorithm by starting with something naive like this, i.e. find the shortest path by using concurrent timers to simulate traversing all possible paths at a fixed speed and see which