Implementation details

• Prim’s algorithm is O(E lg V)

• By using fibonacci heaps to implement a priority queue this can be improved to O(E+V lg V)

• Where E is the number of edges in the graph and V is the number of vertices.