Menshin 1c0355a19d * Made the Priority Queue insertion use dichotomic search to find the position of the inserted element ...

* Added a generic (array based) heap data structure
* Changed A* to use a heap open set instead of a priority queue
* Fixed A* not checking for already processed turfs
* Fixed A* number of traversed nodes not being updated on new route
* Changed the heuristic proc for every A* calls to /turf/proc/Distance_cardinal, since A* now only progress in cardinal directions

2015-09-30 00:05:45 +02:00

1.7 KiB

Raw Blame History

View Raw