Fibonacci_Heap Class Reference

Classes
class	Node

Detailed Description

Fibonacci heap. This heap is heavily optimized for the Insert and Pop functions. Peek and Pop always return the current lowest value in the list. Insert is implemented as a lazy insert, as it will simply add the new node to the root list. Sort is done on every Pop operation.

---

The documentation for this class was generated from the following file:

• main.nut