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.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-166563 |
| Date | January 2020 |
| Creators | Östholm, Eric, Karlsson, Anton |
| Publisher | Linköpings universitet, Interaktiva och kognitiva system, Linköpings universitet, Interaktiva och kognitiva system |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0052 seconds