Java: Prim's with Fibonacci heap? (JGraphT)

Question

JGraphT has a nice Fibonacci Heap class. How can I use it to implement Prim's minimum spanning tree algorithm?

Answer 1

I'm not trying to be sarcastic here, but...same way you would write Prim's algorithm with any other priority queue?

You'd have to write a wrapper class to rename the methods, since (from a cursory look through the JGraphT Javadocs) it doesn't looks like these developers implemented the Queue interface. So you have to write a method called offer that just calls insert, and so on. (Since this is open-source, you should consider making your edits right in the class itself, and sending the project your code when you're done.)

Is there some subtlety here that I'm missing?