Prim-rev

Implementation of Prim's algorithm for a minimum spanning tree using a Fibonacci heap.

Algorithm has a complexity of O(E + V*lg(V)), where E is the number of edges and V the number of vertices.