Hi all,

I am currently converting the JPS pathfinding code from C++ to Delphi and the code I'm converting uses the std::heap to manage the open node list.

Now, I never used the heap before and I was wondering what structure in Delphi I could use in its place or if there was a heap class for Delphi anyone had already done.

My knowledge of the STD is kinda abysmal as I usually never need to use it in my daily work, so any help on this would be met with untold gratitudes ;)

Thanks!

Ah, indeed!

Thanks to you both. "Priority queue" lead me in the right direction and I now have it working. Now to test it and continue on my merry way!

:D