quote: Original post by Kylotan

Yes, I believe the priority_queue adapter inhibits access to any element except the top one, so modification of the open list (as A* requires) is not so practical with that implementation.

Out of interest, what data structure do you use for your closed list? I think I use some sort of mapped-bitset (just a minimal-storage hash table, I guess), but I don't recall if that is actually in my A* implementation. (I have a few different pathfinding algorithms implemented and I'm not at my home computer )

I have used both the STL list and the STL map containers for CLOSE list implementations. I think they are about the same in performance in their role as CLOSE lists. They both can rely on the actual NODE pointer address that is stored, as a key value, for identification purposes, so non-contiguous x,y,z nodes can be supported.

Eric


Edited by - Geta on June 23, 2000 9:22:25 AM