On 12/20/2010 05:01 PM, Andrei Alexandrescu wrote: > Just saw this: > > http://www.reddit.com/r/programming/comments/eoq15/implementing_shortest_path_in_c_is_much_easier/ > > > in which a reader points to this paper on thin heaps: > > http://www.cs.princeton.edu/courses/archive/spr04/cos423/handouts/thin%20heap.pdf > > > Does anyone here have experience with thin heaps? I think they'd be a > good addition to std.container. You might have realized my recent interest in std.container.BinHeap as a priority queue. In fact I thought about implementing Fibonacci Heaps with the same interface for D. I worked on a C++ implementation a while ago, so maybe I should give the Thin Heaps a try?
Matthias