1 This is a fibonacci-heap priority-queue implementation. This project
2 is different from K. Kodamas PQueue in that it allows a decrease key
3 operation. That makes PriorityQueue usable for algorithms like
4 dijkstras shortest path algorithm, while PQueue is more suitable for