Java: Prim with a bunch of Fibonacci? (JGraphT)

Question

JGraphT has a Fibonacci Heap class. How can I use it to implement the correct minimum spanning tree algorithm ?

Answer 1

You need to write a wrapper class to rename methods, because (from a quick look at JGraphT Javadocs) it does not look like these developers implemented the Queue interface. So you need to write a method called a sentence that just calls the insert, etc. (Since this is open source, you should consider making changes to the class itself and submitting the project when you are done.)