Coolbeans
Having an issue implementing A* pathfinding
Hi I have started trying to use a priority queue and hash-set instead of lists for my open and closed sets and I was wondering how I should go about comparing newly explored nodes with nodes in the open list to see if they already exist? As I don't know of a way of iterating and looking through a priority queue?
19 replies