title: Is there a standard Java implementation of a Fibonacci heap?
body: <p>I was looking at the different kind of heap data structures. </p>
  
  <p>The Fibonacci heap seems to have the better worst case complexity for (1) insertion, (2) deletion and (2) finding the minimum element.</p>
  
  <p>I have found that in Java there is a class <code>PriorityQueue</code> that is a balanced binary heap.  But why they did not use a Fibonacci heap?</p>
  
  <p>Also, is there an implementation of a Fibonacci heap in <code>java.util</code>?</p>
  
  <p>Thanks!</p>