A grid based path finding system using a version of Dijkstra's algorithm created with AppGameKit.
- Distances should be stored within each tile on a grid.
- The distances will then be used to work out the best path from the point to a destination.
- This way rather than pathfinding on a per entity basis the entities can use the distance stored in the tiles to workout the path.
I have chosen the MPL 2.0 licence as it makes it easy for you to use the work in your project without worrying about it impacting your licencing.
The licencing is only a per file basis and changes to the files you make should be released under the same licence.
This way we can all benefit from each other.
This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at https://mozilla.org/MPL/2.0/.
Please see https://www.mozilla.org/en-US/MPL/2.0/FAQ/ for FAQ on the MPL 2.0 licence.
Licence headers are available here: https://www.mozilla.org/en-US/MPL/headers/