SupSuper/OpenXcom — pull request #158 by karvanit (2012-10-27 01:22:58+00:00)
Title: Pathfinding - A* fully implemented

New A* code that uses priority queue. It is O(N*log(N)) code that is guaranteed to find the shortest path, if one exists.

Also contains some slight code refactoring in PathfindingNode management in Pathfinding (uses std::vector instead of a manual array of pointers).