A Fibonacci heap is an implementation of a priority queue that supports amortized O(1) insertion, merge, find-min, and decrease-key, along with amortized O(log n) delete and extract-min. When implemented with a Fibonacci heap, Dijkstra's algorithm and Prim's algorithm can be made to work in O(E + V log V).
Questions tagged [fibonacci-heap]
77 questions
0
votes
1 answer
FibonacciHeap increase_key implementation
.
Hi guys,
I'm using Erel Segal's C++ STL FibonacciHeap http://ideone.com/9jYnv and I think it's lacking of a increase_key() method.
/**
* template Fibonacci Heap
*
* @ref http://en.wikipedia.org/wiki/Fibonacci_heap
* @ref…
Cob013
- 1,057
- 9
- 22
-1
votes
1 answer
Fibonacci Vs. Binary Boost heap performance in the Fast Marching Method
I now this is a question asked many times. However, I cannot find a solution for my specific problem.
I have implemented the Fast Marching Method (really similar to Dijkstra) in C++11 and two different variants: with Fibonacci heap and Binary Heap.…
Javi
- 3,440
- 5
- 29
- 43