What is the runtime complexity of the Prim's algorithm for finding the minimum spanning tree of a graph?

The runtime complexity of Prim's algorithm is O(V2) or O(E log V), where V is the number of vertices and E is the number of edges in the graph.