#include <cstddef>
#include <fstream>
Go to the source code of this file.
Classes | |
| class | FibNode< Data > |
| class | CPool< T > |
| class | FibHeap< Data > |
Typedefs | |
| typedef size_t | size_type |
Theoretically fibonacci heaps should be asymptocically faster than "normal" priority queues (measured in amortized costs). However, this implementation has neither algorithmically nor architecture specifically tuned to its maximum extend. The memory overhead for tiny data structures is enormous, the pointer access to data members is evil for any branch prediction and cached memory access on modern processors.
This implementation cannot practically compete with highly optimized priority queue implementations.
Definition in file fibheap.H.
1.5.4