hi,
I have used Fibonacci heaps
I learnt that fib heaps have better time complexity (amortized O(1)) than
binary heaps
but I havent compared the performance of these two at same time
do u say that binary heap will perform better than a fibonacci heap ?
for some algos say(Dijkstra ,Prim,..)
I
No i cant tell, how it is in practice, but i thik , that binary heaps should
have some advantages also.
The one is that they are easier to implement.
But it would be good if you have some project and if you can to test the
performance of both heaps.
2009/8/8 Arun N arunn3...@gmail.com
hi,
I
No there si no such function.
The best solution would be not to use priority queue, but other design.
If it wont work you can try to use splay tree. But it has big overhead.
Theoreticaly best would be fibbonaci heap but it heas even bigger overhead
than splay tree.
2009/8/7 mirosuaf
