Shaved 6 seconds off startup time. Holy shit.

Instead of precomupting all paths with floyd-warshall on map start
(O(|V|^3) algorithm), use breadth-first search to Shaved 6 seconds off
startup time. Holy shit.

Instead of precomupting all paths with floyd-warshall on map start
(O(|V|^3) algorithm), we use bounded breadth-first search to find the
neighbors of the start node, then check which of those are in the same
connected component as the start node.