.NET Standard roguelike library in C#. Features many algorithms and data structures pertinent to roguelike/2D game developers, specifically designed to be minimally intrusive upon the developer's architecture.
MIT License
494
stars
31
forks
source link
Explore PriorityQueue Implementation of Goal Maps #307
Currently, goal maps use a Queue to store nodes to visit, and simply re-queue nodes as they're changed; thus avoiding the notion of a priority queue. Due to some constaints provided by the goal map concept, this works; but a proper priority queue implementation may be faster, especially for maps that are not mostly open.
Currently, goal maps use a
Queueto store nodes to visit, and simply re-queue nodes as they're changed; thus avoiding the notion of a priority queue. Due to some constaints provided by the goal map concept, this works; but a proper priority queue implementation may be faster, especially for maps that are not mostly open.We should benchmark this and find out!