Pathfinding in the forest

Abstract: Dijkstra’s algorithm used for pathfinding in a grid type setting consisting of forest geodata with multiple attributes. A cost analysis was performed regarding the memory required to run the application. This cost analysis yielded in a space complexity of O(n), and a class structure with focus on low memory usage while still maintaining desired functionality. The test shows a reduction of about 17,9% in memory usage compared to without memory saving measures. The algorithm and class structure are used in a web-based application implemented with JavaScript.