Given a graph of nodes that identify possible paths around a map, how could you find the shortest path from node A to B? A* is nice, but a bit slow to be using often, especially if there are a lot of nodes and a lot of entities using them. So, I propose we pre-calculate all the shortest paths through a graph, and store it in a table:
Feel free to poke a hole in my logic. I'm not completely sure it's sound.
- issue: n squared storage. But assume 100 or 150 nodes is enough for my map, that's just 10,20,30 kilobytes.
