NodeQueue implementation issues

[sssooonnnggg]

Hi, I'm interested why use a sorted queue to implement the NodeQueue, based on benchmarks and my own tests, the version based on binary heap is faster than sorted list, and the official C++ recast implementation is also using a binary heap.

[sssooonnnggg]

As far as I know, the EnqueueDequeue_* test is closer to a real pathfinding scenario.
Because in the A* algorithm, it is generally to pop the best node first and then push n neighbors within a loop.

[ikpil]

I apologize, I can't recall the details as I implemented it myself due to a bug during development. If you have the tested code, could you share it with me? If, as you mentioned, the binary heap implementation is better, I will review it and apply the changes!

[sssooonnnggg]

Ok, I have submitted a PR to compare the performance differences of the node queue data structure. Please refer to #90.