Pathfinding in the forest
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 lo...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Linköpings universitet, Interaktiva och kognitiva system
2020
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-166563 |