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

[bearophile via Digitalmars-d-learn]

Nordlöw:

Ahh, a Binary Heap perfectly matches my needs.

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

But isn't topNCopy using a heap?

Bye,
bearophile