Is there a Strict Fibonacci Heap implementation available?

Question

I would like to implement a strict fibonacci heap, but the structure is very complicated and it would be nice to have an example implamentation in any language. But I didn't find one yet.

It seems like the paper "Strict Fibonacci Heaps" from 2012 is the only source which describes this structure in detail. But in "A back-to-basics empirical study of priority queues" they measured it's practical performance so they had to implement the heap.

Is there any implementation publicly available?

Answer 1

In the paper that you cite (about the empirical study), the first reference is to their codebase: https://code.google.com/archive/p/priority-queue-testing/source/default/source

I also have an implementation for it, (also in C and still not fully completed), you can check it here: https://github.com/lucid-at-dream/citylife/blob/master/src/base-libs/data_structures/heap.c

Cheers!