Java: Using a Fibonacci Heap for Implementing Dijkstra's Algorithm

Question

New here, but have been lurking as a guest for quite some time :)

Okay, so I\'ve been trying to do Dijkstra\'s shortest path algorithm using a Fibonacci heap (in Jav

Answer 1

The JDK does not provide an implementation of the Fibonacci Heap. You will have to create your own implementation, or you can find one in this post: Fibonacci Heap

All you have to afterwards is replacing

PriorityQueue vertexQueue = new PriorityQueue<>();

by

 FibonacciHeap vertexQueue = new FibonacciHeap<>();

Then simply change the calls to thepoll, add and remove methods with their equivalent in your provided implementation.