Both the heaps are used to run the Minimum Spanning tree algorithms for graphs of different sizes.

Here we see that time taken by Fibonacci heaps is much less than Binary heaps for large graphs. Whereas for small graphs, Binary Heap performs better.