How to do an inverted heap implementation in JAVA?

Why is there no Fibonacci heap implementation in the Standard Java API?

• Given the fact that Fibonacci heap provides better performance than PriorityQueue (http://en.wikipedia.org/wiki/Fibonacci_heap), why is there no Fibonacci class in Standard Java API ?

• Answer:

  Fibonacci heaps are asymptotically faster than binary and binomial heaps, but this does not necessarily mean they are faster in practice. The additional complexity of Fibonacci heaps will likely make them slower for operations on smaller heaps. Additionally, the delete operation has worse worst case complexity. Many applications simply don't need the additional benefit of a Fibonacci heap and adding it bloats the size of the Java standard library for everyone. If your application really does need one, there are non-standard library implementations. People working on the standard library have other priorities to work on. The Java standard library is already very large and I expect takes quite a bit of effort to maintain. Every class they write adds to this burden.