Fibonacci Heap
This is an implementation of a fibonacci heap, an efficient priority queue structure allowing the following operations:
- O(1)
- Find-Minimum
- Insert (Amortized)
- Decrease Key (Amortized)
- Merge (Amortized)
- O(lg n)
- Delete (Amortized)
- Delete Minimum (Amortized)