I'm asking this as a complete noob in pathfinding, so I don't presume to have any deep understanding.
I read somewhere that Dijkstra always calculates the shortest path to all points, not just to the requested point, as opposed to A*.
If this is true, could it be possible to somehow access this data? I'm doing some precalculation of shortest paths and having to call the library only once for every point instead of once for every combination of points would probably be a huge speed up.
I'm asking this as a complete noob in pathfinding, so I don't presume to have any deep understanding.
I read somewhere that Dijkstra always calculates the shortest path to all points, not just to the requested point, as opposed to A*.
If this is true, could it be possible to somehow access this data? I'm doing some precalculation of shortest paths and having to call the library only once for every point instead of once for every combination of points would probably be a huge speed up.