Is there a standard Java implementation of a Fibonacci heap?
But why they did not use a Fibonacci heap?
I think the main reason is because the Fibonacci heap can only help in the case when you have lot more decreaseKey operation connected to one extractMin operation. For example, when you are using it with the Dijkstra's algorithm.
Also, is there an implementation of Fibonacci heap in Java.util?
There is no implementation in Java.util, but I did some experiment on this topic using existing open-source versions of the Fibonacci heap. You can find it on my blog or on the project's GitHub repository.
No, the standard Java collections API does not contain an implementation of a Fibonacci heap. I'm not sure why this is, but I believe it is because while Fibonacci heaps are asymptotically great in an amortized sense, they have huge constant factors in practice. The collections framework also doesn't have a binomial heap, which would be another good heap to include.
As a totally shameless self-plug, I have an implementation of a Fibonacci heap in Java on my personal website. I'm not sure how useful it will be, but if you're curious to see how it works I think it might be a good starting point.
Hope this helps!
But why they did not use a Fibonacci heap?
Probably because those heaps have a lot more overhead per entry than binary keys.
Also, is there an implementation of Fibonacci heap in Java.util?
No, but
- There is graphmaker from Nathan Fiedler - GPL and with good test coverage, but have a look into this nice blog post about it and about problems a fibonacci impl can have. In this post a lot of other Java implementions are referenced.
- There is some code with unit tests here
- The JGraphT project (also Nathan Fiedler) and also with (some minor) tests but LGPL.
- Last but not least there is Neo4j - GPL - no tests.