Computing Shortest Path in O(1) time | Hacker News Reader