title: Has anyone actually implemented a Fibonacci-Heap efficiently?
body: <p>Has anyone of you ever implemented a <a href="http://en.wikipedia.org/wiki/Fibonacci_heap" rel="noreferrer">Fibonacci-Heap</a>? I did so a few years back, but it was several orders of magnitude slower than using array-based BinHeaps.</p>
  
  <p>Back then, I thought of it as a valuable lesson in how research is not always as good as it claims to be. However, a lot of research papers claim the running times of their algorithms based on using a Fibonacci-Heap. </p>
  
  <p>Did you ever manage to produce an efficient implementation? Or did you work with data-sets so large that the Fibonacci-Heap was more efficient? If so, some details would be appreciated.</p>