Keep Track of the Best N Nodes in a Graph Traversal Algorithm

["Nordlöw" via Digitalmars-d-learn]

On Wednesday, 25 March 2015 at 17:49:49 UTC, Tobias Pankrath 
wrote:
> What's wrong with binary heaps?

Ahh, a Binary Heap perfectly matches my needs.

https://en.wikipedia.org/wiki/Binary_heap
http://dlang.org/phobos/std_container_binaryheap.html

Thx