Brodal priority queue implementation

Question

Have someone ever implemented a Brodal queue?

Is it worth implementing or has high running time constants like the Fibonacci Heap?

Why the hostility to this question? It seems reasonable to me. — Heath Hunnicutt
– Heath Hunnicutt, Commented Sep 4, 2011 at 20:11

fred · Accepted Answer · 2011-09-04 22:49:23Z

10

This is a Haskell implementation of Brodal–Okasaki, which is a purely functional variant of Brodal's original data structure with the same time bounds. Since Brodal–Okasaki claim that their structure can be derived by tweaking binomial queues, I expect that pairing heaps would be faster for most uses, though depending on your application, there may be even better structures.

answered Sep 4, 2011 at 22:49

fred

3512 silver badges3 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Simone Over a year ago

thank you! i'll give it a try! i don't know how you managed to find it on the internet, because it was really impossible for me

Collectives™ on Stack Overflow

Brodal priority queue implementation

1 Answer 1

1 Comment

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Related