title: Fibonacci Heap Issue
body: <p>I've been working on a Fibonacci Heap implementation in Java for about a week now. It's the implementation based off of the CLRS book.</p>
  
  <p>I wanted to see if I would get any performance boost using it in a side project I'm working on compared to Java's default PriorityQueue. [The default implementation in Java is array based, so much more local. It may still outperform the F-Heap despite higher bounds in complexity].</p>
  
  <p>My issue seems to stem from the consolidate part of the heap after removing the min element. I keep getting arrayindexoutofboundsexceptions thrown. Specifically in the while loop, when it is consolidating all nodes that have the same degree. It is exceeding the bounds set by the D() function.</p>
  
  <p>So either my D() function is wrong, which, I don't think it is, or something else is happening. Most likely side effect related.</p>
  
  <p>The code is located <a href="http://pastebin.com/f6fc7d4b8" rel="nofollow noreferrer">here</a>. I've been trying to debug this for about week with now luck. Am I missing something obvious?</p>