Finding the shortest path in a road network requires the road network to be loaded up in memory. Using Dijkstra's algorithm, for example, it searches through all the immediate road coordinates and puts a weight on that road based on the distance and time to pass through it. This keeps on going until it reaches the destination coordinate which is when Dijkstra is able to find the shortest path.

This approach is very memory intensive since the whole road network needs to be in memory.

I would like to do some more research and look at the literature when it comes to finding the shortest path on an offline mobile app with limited memory.

Since I am quite new to this finding the appropriate literature to get acquainted with is a problem in itself.

I'm just looking for pointers.

closed as too broad by Hornbydd, Vince, Fran Raga, Ian Turton Jun 16 at 9:43

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.