A* pathfinding example !

[JernejL]

nice, thanks, ill probably make some modifications and post them here

EDIT: as promised:



https://github.com/JernejL/astar

added:
colored cubes, actual path finding that finds the shortest path between the nodes, and some fun stuff

EDIT:

I modified some of the algorythm internals now, for start - i replaced the sorted Tlistbox with a dynamic array instead, and instead of sorting the array i just find the lowest item in the array - which is MUCH faster than sorting the whole list for every added item no matter which sorting algorythm you use, the deletion of item from array is also optimized with using memory MOVE routine.

and i added a cleanup menu button to clear the path searching results.

i also commented most of the new code i added so it should be easy to understand.