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

[via Digitalmars-d-learn]

On Wednesday, 25 March 2015 at 13:55:29 UTC, bearophile wrote:
> Nordlöw:
>
>> I have graph traversal algorithm that needs to keep track of 
>> the N "best" node visit.
>
> std.algorithm.topNCopy?
>
> Bye,
> bearophile

Could you please elaborate a bit how you mean this should be 
used. Notice that the number of visited nodes are in the millions 
or perhaps even tens of millions. And N is typically 100-1000.