FibonacciHeap enters in an infinite loop when applying SpannigTree algorithms

Just replacing the PriorityQueue with the FibonacciHeap in spanning tree algorithms, looks like procedures enter in an infinite loop.

There is something wrong in the data structure - what is really strange is that shortest path algorithms are not affected by the same issue...