Please sign in to comment.
Further >4x speedup by not copying/sorting the open list every iterat…
…ion. Instead I just do an O(n) traversal over openSet.Values, rather than a... What is it -- O(n log n) operation to sort it all? Not as good as a red-black tree, a splay tree, or the ever-mythical HOT-queue, but better.
- Loading branch information...