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?

Answer 1

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.